Light Graphs with Small Routing Cost

Networks

Volumn 39, Issue 3, 2002, Pages 130-138

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

^a SHU TE UNIVERSITY   (Taiwan)

^b NATIONAL YANG MING UNIVERSITY   (Taiwan)

^c NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithms; Network design; Spanning trees

Indexed keywords

ALGORITHMS; COSTS; POLYNOMIALS; TREES (MATHEMATICS);

SPANNING TREES;

TELECOMMUNICATION NETWORKS;

EID: 0141540733     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10019     Document Type: Article

References (23)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares, On sparse spanners of weighted graphs, Discr Comput Geom 9 (1993), 81-100.
2. Y. Bartal, On approximating arbitrary metrics by tree metrics, Proc 30th Ann ACM Symp Theory Comput ACM, Dallas, Texas, 1998, pp. 161-168.
3. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, Time bounds for selection, J Comput Syst Sci 7 (1972), 448-461.
4. L. Cai, NP-completeness of minimum spanner problems, Discr Appl Math 48 (1994), 187-194.
5. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1994.
6. R.C. Entringer, D.J. Kleitman, and L.A. Szekely, A note on spanning trees with minimum average distance, Bull Inst Combin Appl 17 (1996), 71-78.
7. G.N. Frederickson and D.B. Johnson, Generalized selection and ranking: Sorted matrices, SIAM J Comput 13 (1984), 14-30.
8. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J ACM 34 (1987), 596-615.
9. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
10. R. Hassin and A. Tamir, On the minimum diameter spanning tree problem, Info Process Lett 53 (1995), 109-111.
11. T.C. Hu, Optimum communication spanning trees, SIAM J Comput 3 (1974), 188-195.
12. D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy Kan, The complexity of the network design problem, Networks 8 (1978), 279-285.
13. S. Khuller, B. Raghavachari, and N. Young, Balancing minimum spanning trees and shortest-path trees, Algorithmica 14 (1995), 305-321.
14. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Info 15 (1981), 141-145.
15. D. Peleg and E. Reshef, Deterministic polylog approximation for minimum communication spanning trees, Proc 25th Int Colloq on Automata, Languages and Programming (ICALP'98), Aalborg, Denmark, 1998, K.G. Larsen, S. Skyum, and G. Winskel (Editors), LNCS 1443, Springer-Verlag, 1998, pp. 670-681.
16. D. Peleg and A.A. Schäffer, Graph spanners, J Graph Theory 13 (1989), 99-116.
17. J. Plesnik, The complexity of designing a network with minimum diameter, Networks 11 (1981), 77-85.
18. J. Plesnik, On the sum of all distances in a graph or digraph, J Graph Theory 8 (1984), 1-21.
19. R. Wong, Worst-case analysis of network design problem heuristics, SIAM J Alg Discr Methods 1 (1980), 51-63.
20. B.Y. Wu, K.-M. Chao, and C.Y. Tang, Approximation algorithms for the shortest total path length spanning tree problem, Discr Appl Math 105 (2000), 273-289.
21. B.Y. Wu, K.-M. Chao, and C.Y. Tang, Approximation algorithms for some optimum communication spanning tree problems, Discr Appl Math 102 (2000), 245-266.
22. B.Y. Wu, K.-M. Chao, and C.Y. Tang, A polynomial time approximation scheme for optimal product-requirement communication spanning trees, J Alg 36 (2000), 182-204.
23. 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, SIAM J Comput 29 (2000), 761-778.