Algorithms for facility location problems with outliers

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 642-651

  Charikar, Moses ^a   Khuller, Samir ^b   Mount, David M ^b   Narasimhan, Gin ^c  

^a Stanford University   (United States)

^b University of Maryland ^*  (United States)

^c University of Memphis   (United States)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

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

References (32)

1. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.2, October 14-16, 1996
2. Sanjeev Arora, Prabhakar Raghavan, Satish Rao, Approximation schemes for Euclidean k-medians and related problems, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.106-113, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/276698.276718]
3. M. L. Balinski, "On finding integer solutions to linear programs", Proc. of the IBM Scientific Computin9 Symposium on Combinatorial Problems, pages 225- 248, (1966).
4. Moses Charikar, Sudipto Guha, Improved Combinatorial Algorithms for the Facility Location and k-Median Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.378, October 17-18, 1999
5. Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys, A constant-factor approximation algorithm for the k-median problem (extended abstract), Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.1-10, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/301250.301257]
6. Fabián A. Chudak, Improved Approximation Algorithms for Uncapitated Facility Location, Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization, p.180-194, June 22-24, 1998
7. G. Cornuejols, G. L. Nemhauser and L. A. Wolsey, "The uncapacitated facility location problem", Discrete Location Theory (ed: Mirchandani and Francis), pages 119-171, (1990).
8. Tomás Feder, Daniel Greene, Optimal algorithms for approximate clustering, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.434-444, May 02-04, 1988, Chicago, Illinois, United States [doi〉10.1145/62212.62255]
9. Uriel Feige, A threshold of ln n for approximating set cover, Journal of the ACM (JACM), v.45 n.4, p.634-652, July 1998 [doi〉10.1145/285055.285059]
10. Michel X. Goemans, David P. Williamson, A General Approximation Technique for Constrained Forest Problems, SIAM Journal on Computing, v.24 n.2, p.296-317, April 1995 [doi〉10.1137/S0097539793242618]
11. Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David Williamson, A note on the prize collecting traveling salesman problem, Mathematical Programming: Series A and B, v.59 n.3, p.413-420, May 7, 1993 [doi〉10.1007/BF01581256]
12. M. Dyer and A. M. Frieze. A simple heuristic for the p-center problem. Operations Research Letters, 3:285- 288, 1985.
13. Sudipto Guha, Samir Khuller, Greedy strikes back: improved facility location algorithms, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.649-657, January 25-27, 1998, San Francisco, California, United States
14. Martha Hamilton. Loud and clear, a silent e. The Washington Post, April 23 2000.
15. D. S. Hochbaum, "Heuristics for the fixed cost median problem", Mathematical Programming, 22: 148-162, (1982).
16. Dorit S. Hochbaum, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, 1996
17. Dorit S. Hochbaum, David B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, Journal of the ACM (JACM), v.33 n.3, p.533-550, July 1986 [doi〉10.1145/5925.5933]
18. Anil K. Jain, Richard C. Dubes, Algorithms for clustering data, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
19. Kamal Jain, Vijay V. Vazirani, Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.2, October 17-18, 1999
20. Samir Khuller, Anna Moss, Joseph (Seffi) Naor, The budgeted maximum coverage problem, Information Processing Letters, v.70 n.1, p.39-45, April 01, 1999 [doi〉10.1016/S0020-0190(99)00031-9]
21. Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman, Analysis of a local search heuristic for facility location problems, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.1-10, January 25-27, 1998, San Francisco, California, United States
22. A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouses", Management Science, 9:643-666, (1963).
23. Jyh-Han Lin, Jeffrey Scott Vitter, Approximation algorithms for geometric median problems, Information Processing Letters, v.44 n.5, p.245-249, Dec. 21, 1992 [doi〉10.1016/0020-0190(92)90208-D]
24. A. S. Manne, "Plant location under economies-ofscale- decentralization and computation", Management Science, 11:213-235, (1964).
25. Jirí Matoušek, David M. Mount, Nathan S. Netanyahu, Efficient randomized algorithms for the repeated median line estimator, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.74-82, January 25-27, 1993, Austin, Texas, United States
26. D. Mount, N. Netanyahu, and J. LeMoigne. Efficient algorithms for robust point pattern matching and applications to image registration. In Proc. of the CESDIS Image Registration Workshop, pages 247-256, 1997.
27. David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu, A practical approximation algorithm for the LMS line estimator, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.473-482, January 05-07, 1997, New Orleans, Louisiana, United States
28. George L. Nemhauser, Laurence A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience, New York, NY, 1988
29. J. Plesnik, A heuristic for the p-center problem in graphs, Discrete Applied Mathematics, v.17 n.3, p.263-268, June 1987 [doi〉10.1016/0166- 218X(87)90029-1]
30. P. J. Rousseeuw, A. M. Leroy, Robust regression and outlier detection, John Wiley & Sons, Inc., New York, NY, 1987
31. David B. Shmoys, Éva Tardos, Karen Aardal, Approximation algorithms for facility location problems (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.265-274, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/258533.258600]
32. J. F. Stollsteimer, "A working model for plant numbers and locations", J. Farm Econom., 45: 631-645, (1963).