Approximating k-median via pseudo-approximation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 901-910

  Li, Shi ^a   Svensson, Ola ^b  

^a EPFL ^*

^b EPFL   (Switzerland)

Author keywords

Approximation algorithms; Combinatorial optimization; K median; Network location problems

Indexed keywords

APPROXIMATION RATIOS; K-MEDIAN; NETWORK LOCATION PROBLEMS; TWO-COMPONENT;

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY;

APPROXIMATION ALGORITHMS;

EID: 84879819439     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488723     Document Type: Conference Paper

References (24)

1. A. Archer, R. Rajagopalan, and D. B. Shmoys. Lagrangian relaxation for the k-median problem: new insights and continuity properties. In In Proceedings of the 11th Annual European Symposium on Algorithms, pages 31-42, 2003.
2. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, STOC '01, pages 21-29, New York, NY, USA, 2001. ACM.
3. P. Awasthi, A. Blum, and O. Sheffet. Stability yields a ptas for k-median and k-means clustering. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 309-318, Washington, DC, USA, 2010. IEEE Computer Society.
4. P. S. Bradley, Fayyad U. M., and O. L. Mangasarian. Mathematical programming for data mining: Formulations and challenges. INFORMS Journal on Computing, 11:217-238, 1998.
5. J. Byrka. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In APPROX '07/RANDOM '07: Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 29-43, Berlin, Heidelberg, 2007. Springer-Verlag.
6. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 378-388, 1999.
7. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem (extended abstract). In Proceedings of the thirty-rst annual ACM symposium on Theory of computing, STOC '99, pages 1-10, New York, NY, USA, 1999. ACM.
8. F. A. Chudak and D. B. Shmoys. Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput., 33(1):1-25, 2004.
9. J. Chuzhoy and Y. Rabani. Approximating k-median with non-uniform capacities. In SODA, pages 952-958, 2005.
10. S Guha and S Khuller. Greedy strikes back: Improved facility location algorithms. In Journal of Algorithms, pages 649-657, 1998.
11. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM, 50:795-824, November 2003.
12. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, STOC '02, pages 731-740, New York, NY, USA, 2002. ACM.
13. 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.
14. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, SODA '98, pages 1-10, Philadelphia, PA, USA, 1998. Society for Industrial and Applied Mathematics.
15. A. A. Kuehn and M. J. Hamburger. A heuristic program for locating warehouses. 9(9):643-666, July 1963.
16. J. B. Lasserre. An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM Journal on Optimization, 12(3):756-769, 2002.
17. S. Li. A 1.488 approximation algorithm for the uncapacitated facility location problem. In Automata, Languages and Programming - 38th International Colloquium (ICALP), pages 77-88, 2011.
18. S. Li and O. Svensson. Approximating k-median via pseudo-approximation. CoRR, abs/1211.0243, 2012.
19. J. Lin and J. S. Vitter. Approximation algorithms for geometric median problems. Inf. Process. Lett., 44:245-249, December 1992.
20. J. Lin and J. S. Vitter. ?-approximations with minimum packing constraint violation (extended abstract). In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), Victoria, British Columbia, Canada, pages 771-782, 1992.
21. M. Mahdian, Y. Ye, and J. Zhang. Approximation algorithms for metric facility location problems. SIAM J. Comput., 36(2):411-432, 2006.
22. A. S. Manne. Plant location under economies-of-scale-decentralization and computation. In Managment Science, 1964.
23. H. D. Sherali and W. P. Adams. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math., 3(3):411-430, 1990.
24. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems (extended abstract). In STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 265-274, New York, NY, USA, 1997. ACM.