Constructing light spanning trees with small routing cost

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 334-344

  Wu, Bang Ye ^a   Chao, Kun Mao ^b   Tang, Chuan Yi ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithms; Network design; Spanning trees

Indexed keywords

APPROXIMATION ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS;

MINIMUM ROUTING COST TREE; MINIMUM SPANNING TREES; NETWORK DESIGN; NON NEGATIVES; ROUTING COSTS; SPANNING TREE; TIME COMPLEXITY; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 84957079959     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_31     Document Type: Conference Paper

References (9)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares, On sparse spanners of weighted graphs, Discrete and Computational Geometry, 9(1):81-100,1993.
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, theMIT Press, 1994.
3. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. of the ACM, 34(3):596-615, 1987.
4. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979.
5. T. C. Hu, Optimum communication spanning trees, SIAM J. Computing, 3(3):188-195, 1974.
6. D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy Kan, The complexity of the network design problem, Networks, 8:279-285, 1978.
7. S. Khuller, B. Raghavachari, and N. Young, Balancing minimum spanning trees and shortest-path trees, Algorithmica, 14:305-321, 1995.
8. R. Wong, Worst-case analysis of network design problem heuristics. SIAM J. Algebraic Discrete Mathematics, 1:51-63, 1980.
9. B. Y. Wu, G. Lancia, V. Bafna, K. M. Chao, R. Ravi, and C. Y. Tang, A polynomial time approximation scheme for minimum routing cost spanning trees, Proceedings of Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), pp. 21-32, 1998.