Improved primal-dual approximation algorithm for the connected facility location problem

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

Volumn 5165 LNCS, Issue , 2008, Pages 265-277

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

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

Author keywords

Approximation algorithms; Facility location problem; Primal Dual algorithms

Indexed keywords

BEVERAGES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; FACILITIES; OPTIMIZATION;

CONNECTED FACILITY LOCATION; FACILITY LOCATION PROBLEM; GRAPH G; INTERNATIONAL CONFERENCES; PRIMAL-DUAL ALGORITHMS; PRIMAL-DUAL APPROXIMATION ALGORITHM;

APPROXIMATION ALGORITHMS;

EID: 51849125489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_25     Document Type: Conference Paper

References (19)

1. Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40, 245-269 (2004)
2. Shmoys, D.B., Tardos, Ér., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory on Computing, pp. 265-274 (1997)
3. Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing 24, 296-317 (1995)
4. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. Journal of Algorithms 31, 228-248 (1999)
5. Jain, K., Vazirani, V.V.: Approximation algorithms for the metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM 48, 274-296 (2001)
6. Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1-10 (1998)
7. Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 229-242 (2002)
8. Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: APPROX-RANDOM, pp. 29-43 (2007)
9. Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: STOC 2002: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 731-740 (2002)
10. Chudak, F.A., Shmoys, D.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM Journal on Computing 33(1), 1-25 (2003)
11. Pal, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of The 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 329-338 (2001)
12. Mahdian, M., Pal, M.: Universal facility location. In: Proceedings of 11the European Symposim on Algorithms, pp. 409-422 (2003)
13. Karger, D.R., Minkoff, M.: Building steiner trees with incomplete global knowledge. In: FOCS 2000: Proceedings of 41st Annual Symposium on Foundations of Computer Science, pp. 613-623 (2000)
14. Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 389-398 (2001)
15. Hasan, M.K., Jung, H., Chwa, K.-Y.: Improved approximation algorithm for connected facility location problems. In: Proceedings of The First International Conference on Combinatorial Optimization and Applications, pp. 311-322 (2007)
16. Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Approximating connected facility location problems via random facility sampling and core detouring. In: SODA 2008: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1174-1183 (2008)
17. Williamson, D.P., van Zuylen, A.: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. Operations Research Letters 35(6), 707-712 (2007)
18. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of The 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 329-338 (2000)
19. Levi, R., Shmoys, D.B., Swamy, C.: LP-based spproximation slgorithms for capacitated facility location. In: Proceedings of IPCO, pp. 206-218 (2004)