Upgrading bottleneck constrained forests

Discrete Applied Mathematics

Volumn 108, Issue 1-2, 2001, Pages 129-142

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

^a ZUSE INSTITUTE BERLIN   (Germany)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c UNIVERSITY OF WÜRZBURG   (Germany)

^d State University of New York   (United States)

Author keywords

Approximation algorithm; Constrained Forest; Network design; Node upgrade

Indexed keywords

EID: 0142062220     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00222-5     Document Type: Article

References (9)

1. Berman O. Improving the location of minisum facilities through network modification. Ann. Oper. Res. 40:1992;1-16.
2. U. Feige, A threshold of ln n for approximating set cover, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96), 1996, pp. 314-318.
3. M.X. Goemans, A.V. Goldberg, S. Plotkin, D.B. Shmoys, E. Tardos, D.P. Williamson, Improved approximation algorithms for network design problems, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94), January 1994, pp. 223-232.
4. Goemans M.X., Williamson D.P. A general approximation technique for constrained forest problems. SIAM J. Comput. 24:1995;296-317.
5. S.O. Krumke, M.V. Marathe, H. Noltemeier, R. Ravi, S.S. Ravi, R. Sundaram, H.C. Wirth, Improving spanning trees by upgrading nodes, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Lecture Notes in Computer Science, Vol. 1256, 1997, pp. 281-291.
6. S.O. Krumke, H. Noltemeier, S.S. Ravi, M.V. Marathe, K.U. Drangmeister, Modifying networks to obtain low cost trees, Proc. 22nd Internat. Workshop on Graph-Theoretic Concepts in Computer Science, Cadenabbia, Italy, Lecture Notes in Computer Science, Vol. 1197, June 1996, pp. 293-307.
7. Klein P., Ravi R. A nearly best-possible approximation for node-weighted Steiner trees. J. Algorithms. 19:1995;104-115.
8. C. Phillips, The network inhibition problem, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC'93), May 1993, pp. 776-785.
9. Paik D., Sahni S. Network upgrading problems. Networks. 26:1995;45-58.