Facility location with hierarchical facility costs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 153-161

  Svitkina, Zoya ^a   Tardos, Eva ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHM; HIERARCHICAL FACILITY COSTS; LOCATION PROBLEM;

ALGORITHMS; APPROXIMATION THEORY; COSTS; INSTALLATION; PROBLEM SOLVING;

HIERARCHICAL SYSTEMS;

EID: 33244475995     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109576     Document Type: Conference Paper

References (16)

1. V. Arya, N. Garg, R. Khandekar, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In Proc. 33rd ACM Symp. on Theory of Computing, pages 21-29, 2001.
2. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proc. 40th IEEE Symp. on Foundations of Computer Science, pages 378-388, 1999.
3. F. A. Chudak. Improved approximation algorithms for uncapitated facility location. In IPCO, pages 180-194, 1998.
4. F. A. Chudak and D. B. Shmoys. Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput., 33(1):l-25, 2003.
5. Z. Drezner. Facility Location: A Survey of Applications and Methods. Springer, 1995.
6. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. J. Comput. Syst. Sci., 63(1):21-41, 2001.
7. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. J. Algorithms, 31(1):228-248, 1999.
8. A. Hayrapetyan, C. Swamy, and E. Tardos. Network design for information networks. In Proc. 16th ACM Symp. on Discrete Algorithms, pages 933-942, 2005.
9. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM, 48(2):274-296, 2001.
10. M. R. Korupolu, C. G. Plaxton, and R. Rajararnan. Analysis of a local search heuristic for facility location problems. J. Algorithms, 37(1):146-188, 2000.
11. M. Mahdian and M. Pal. Universal facility location. In European Symposium on Algorithms, pages 409-421, 2003.
12. M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. In APPROX, pages 229-242, 2002.
13. D. Shmoys, C. Swamy, and R. Levi. Facility location with service installation costs. In Proc. 15th ACM Symp. on Discrete Algorithms, pages 1088-1097, 2004.
14. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proc. 29th ACM Symp. on Theory of Computing, pages 265-274, 1997.
15. M. Sviridehko. An improved approximation algorithm for the metric uncapacitated facility location problem. In IPCO pages 240-257, 2002.
16. P. von Rickenbach and R. Wattenhofer. Gathering correlated data in sensor networks. In DIALM-POMC '04: Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, pages 60-66, 2004.