Improved approximation algorithm for connected facility location problems

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

Volumn 4616 LNCS, Issue , 2007, Pages 311-322

  Hasan, Mohammad Khairul ^a   Jung, Hyunwoo ^a   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; LINEAR PROGRAMMING; NUMERICAL METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

CONNECTED FACILITY LOCATION PROBLEMS; CONNECTED GRAPHS; STEINER TREE;

APPROXIMATION ALGORITHMS;

EID: 38149083480     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73556-4_33     Document Type: Conference Paper

References (8)

1. Karger, D.R., Minkoff, M.: Building steiner trees with incomplete global knowledge. In: FOCS '00: Proceedings of 41st Annual Symposiam on Foundations of Computer Science, Washington, DC, USA, 2000, p. 613. IEEE Computer Society Press, Los Alamitos (2000)
2. Gupta, A., Kleinberg, J.M., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: ACM Symposium on Theory of Computing, pp. 389-398. ACM Press, New York (2001)
3. Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 256-269. Springer, Heidelberg (2002)
4. Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica, 40, 245-269 (2004)
5. Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of Computing, pp. 365-372. ACM Press, New York, NY, USA (2003)
6. Lin, J., Vitter, J.S.: ε-approximations with minimum packing constraint violation. In: Proceedings of 24th STOC, pp. 771-782 (1992)
7. Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory on Computing, pp. 265-274. ACM Press, New York (1997)
8. Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal of Computing, 24, 296-317 (1995)