A constant factor approximation algorithm for k-median clustering with outliers

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 826-835

  Chen, Ke ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME;

ALGORITHMS; CLUSTERING ALGORITHMS; POLYNOMIAL APPROXIMATION; SET THEORY;

APPROXIMATION ALGORITHMS;

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

References (19)

1. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. SIAM J. Comput., 33(3):544-562, 2004.
2. A. Aboud and Y. Rabani. Correlation clustering with penalties. manuscript, 2006.
3. Y. Bartal, M. Charikar, and D. Raz. Approximating min-sum k-clustering in metric spaces. In Proc. 33rd Annu. ACM Sympos. Theory Comput., pages 11-20, 2001.
4. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and kmedian problems. In Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci., pages 378-388, 1999.
5. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. J. Comput. Sys. Sci., 65(1):129-149, 2002.
6. K. Chen. A constant factor approximation algorithm for k-median clustering with outliers. Available at http://www.uiuc.edu/~kechen/outliers.pdf, 2007.
7. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pages 642-651, 2001.
8. J. Chuzhoy and Y. Rabani. Approximating kmedian with non-uniform capacities. In Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, pages 952-958, 2005.
9. M. X. Goemans. Minimum bounded degree spanning trees. In Proc. 47th Annu. IEEE Sympos. Found. Comput. Sci., pages 273-282, 2006.
10. S. Har-Peled and S. Mazumdar. Coresets for k- means and k-median clustering and their applications. In Proc. 36th Annu. ACM Sympos. Theory Comput., pages 291-300, 2004.
11. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factorrevealing LP. J. Assoc. Comput, Mach., 50(6):795-824, 2003.
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. J. Assoc. Comput. Mach., 48(2):274-296, 2001.
13. S. Khuller. Problems column. ACM Trans. Algorithms, 1(1):157-159, 2005.
14. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. J. Algorithms, 37(1);146-188, 2000.
15. J-H Lin and J. S. Vitter. ε-approximations with minimum packing constraint violation (extended abstract). In Proc. 24th Annu. ACM Sympos. Theory Comput., pages 771-782, 1992.
16. M. Mahdian. Facility Location and the Analysis of Algorithms through Factor-Revealing Programs. Ph.D. dissertation, MIT, Department of Computer Science, 2004.
17. D. Ren, I. Rahal, W. Perrizo, and K. Scott. A vertical distance-based outlier detection method with local pruning. In Proc. 13th ACM Conf. Information and Knowledge Management, pages 279-284, 2004.
18. M. Singh and L. C. Lau. Approximating minimum bounded degree spanning trees to within one of optimal. In Proc. 39th Annu. ACM Sympos. Theory Comput., pages 661-670, 2007.
19. Z. Svitkina and E. Tardos. Approximation algorithm for facility location with hierarchical facility costs. In Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pages 1088-1097, 2006.