Approximating k-median with non-uniform capacities

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 952-958

  Chuzhoy, Julia ^a   Rabani, Yuval ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING; LAGRANGIAN RELAXATION; METRIC DISTANCE; POLYNOMIAL TIME;

ALGORITHMS; CONFORMAL MAPPING; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; INTEGRATION; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION THEORY;

EID: 20744435601     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. V. Arya, N. Garg, R. Khandekar, M. Meyerson, K. Mungala and V. Pandit. Local search heuristics for k-median and facility location problems. In Proceedings of 33rd ACM Symposium on Theory of Computing, pages 21-29, 2001.
2. Y. Bartal, M. Charikar and D. Raz. Approximating min-sum k-clustering in metric spaces. In Proceedings of 33rd ACM Symposium on Theory of Computing, pages 11-20, 2001.
3. M. Charikar and S. Guha. Improved combinatorial algorithms for facility location and k-median problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 378-388, 1999.
4. M. Charikar, S. Guha, É. Tardos, D.B. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 1-10, 1999.
5. F.A. Chudak. Improved approximation algorithms for uncapacitated facility location. In R.E. Bixby, E.A. Boyd, and R.Z. Rios-Mercado, editors, Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, pages 180-194. Springer, Berlin, 1998.
6. F.A. Chudak and D.B. Shmoys. Improved approximation algorithms for the capacitated facility location problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875-876, 1999.
7. G. Cornuejols, G.L. Nemhauser and L.A. Wolsey. The uncapacitated faculty location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory, pages 119-171. John Wiley and Sonce Inc., 1990.
8. S. Guha. Approximation algorithms for facility location problems. Ph.D. thesis, Stanford University, 2000.
9. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31, pages 228-248, 1999.
10. K. Jain, M. Mahdian, E. Markakis and A. Saberi. Greedy Facility Location Algorithms Analyzed using Dual Fitting. Submitted to Journal of ACM, 2002.
11. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems, In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 731-740, 2002.
12. K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48, pages 274-296, 2001.
13. M.R. Korupolu, C.G. Plaxton and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1-10, 1998.
14. J.-H. Lin and J.S. Vitter. ε-approximations with minimum packing constraint violation. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 771-782, 1992.
15. M. Mahdian, E. Markakis, A. Saberi and V.V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. In Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, volume 2129 of Lecture Notes in Computer Science, pages 127-137. Springer-Verlag, 2001.
16. M. Mahdian, Y. Ye and J. Zhang. Improved approximation algorithms for metric facility location problems. In K. Jansen, S. Leonardi, V.V. Vazirani, editors, Approximation Algorithms for Combinatorial Optimization, volume 2462 of Lecture Notes in Computer Science, pages 229-242. Springer, 2002.
17. A. Moss, Y. Rabani. Approximation algorithms for constrained node weighted steiner tree problems. In Proceedings of 33rd ACM Symposium on Theory of Computing, pages 373-382, 2001.
18. M. Pal, É. Tardos, T. Wexler. Facility Location with Hard Capacities. In Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science, pages 329-338, 2001.
19. D.B. Shmoys. Approximation algorithms for facility location problems. In K. Jansen and S. Khuller, editors, Approximation Algorithms for Combinatorial Optimization, volume 1913 of Lecture Notes in Computer Science, pages 27-33. Springer, Berlin, 2000.
20. D. B. Shmoys, E. Tardos and K.I. Aardal. Approximation algorithms for facility location problems. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 265-274, 1997.
21. M. Sviridenko. An improved approximation algorithm for the metric uncapacitated facility location problem. In W.J. Cook and A.S. Schulz, editors, Integer Programming and Combinatorial Optimization, volume 2337 of Lecture Notes in Computer Science, pages 240-257. Springer, Berlin, 2002.