Author： Ben-Dor A. Halevi S. Schuster A.
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.31, Iss.1, 1998-02, pp. : 41-61
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
By Busch Costas
Theory of Computing Systems, Vol. 37, Iss. 3, 2004-05 ,pp. :
Access to resources
Recommend
Domination analysis of greedy heuristics for the frequency assignment problem
Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. :
Forcing Linearity on Greedy Codes
Designs, Codes and Cryptography, Vol. 9, Iss. 1, 1996-10 ,pp. :
By Monroe Laura
Designs, Codes and Cryptography, Vol. 9, Iss. 1, 1996-10 ,pp. :
By Dilworth S.
Constructive Approximation, Vol. 34, Iss. 2, 2011-10 ,pp. :