Improving Minimum Cost Spanning Trees by Upgrading Nodes

Journal of Algorithms

Volumn 33, Issue 1, 1999, Pages 92-111

  Krumke, S O ^a   Marathe, M V ^b   Noltemeier, H ^a   Ravi, R ^c   Ravi, S S ^d   Sundaram, R ^e,f   Wirth, H C ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d State University of New York   (United States)

^e Delta Global Trading   (United States)

^f MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Bicriteria problems; Combinatorial algorithms; Network design; Spanning trees

Indexed keywords

EID: 0347760024     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1021     Document Type: Article

References (14)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network flows," Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. O. Berman, Improving the location of minisum facilities through network modification, Ann. Oper. Res. 40 (1992), 1-16.
3. U. Feige, A threshold of In n for approximating set cover, in "Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96), 1996," pp. 314-318.
4. G. N. Frederickson and R. Solis-Oba, Increasing the weight of minimum spanning trees, in "Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'96)," January 1996, pp. 539-546.
5. M. R. Garey and D. S. Johnson, "Computers and Intractability (A Guide to the Theory of NP-Completeness)," Freeman, New York, 1979.
6. S. E. Hambrush and H.-Y. Tu, Edge weight reduction problems in directed acyclic graphs, J. Algorithms 24 (1997), 66-93.
7. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, Improving spanning trees by upgrading nodes, in "Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97)," Lecture Notes in Computer Science, vol. 1256, 1997, pp. 281-291.
8. S. O. Krumke, H. Noltemeier, M. V. Marathe, R. Ravi, and S. S. Ravi, "Improving Steiner Trees of a Network under Multiple Constraints," Tech. Report LA-UR96-1374, Los Alamos National Laboratory, Los Alamos, New Mexico, 1996.
9. S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe, and K. U. Drangmeister, Modifying networks to obtain low cost trees, in "Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science," Cadenabbia, Italy, Lecture Notes in Computer Science, vol. 1197, June 1996, pp. 293-307.
10. F. T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms, in "Proceedings of the 29th Annual IEEE Symposium on the Foundations of Computer Science (FOCS'88)," 1988, pp. 422-431.
11. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Bicriteria network design problems, in "Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP '95)," Lecture Notes in Computer Science, Vol. 944, pp. 487-498, Springer-Verlag, New York/Berlin, 1995.
12. C. Phillips, The network inhibition problem, in "Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC'93)," May 1993, pp. 776-785.
13. D. Paik and S. Sahni, Network upgrading problems, Networks 26 (1995), 45-58.
14. R. Ravi and M. X. Goemans, The constrained minimum spanning tree problem, in "Proceedings Scandinavian Workshop on Algorithmic Theory (SWAT'96)," Reykjavik, Iceland, July 1996.