Approximation schemes for clustering problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 50-58

  Fernandez de la Vega, W ^d   Karpinski, Marek ^a   Kenyon, Claire ^b   Rabani, Yuval ^c  

^a UNIVERSITY OF BONN   (Germany)

^b ÉCOLE POLYTECHNIQUE   (France)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d NONE

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; FUNCTIONS; POLYNOMIAL APPROXIMATION; SET THEORY;

CLUSTERING PROBLEMS;

PROBLEM SOLVING;

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

References (30)

1. P.K. Agarwal and C.M. Procopiuc. Exact and approximation algorithms for clustering. In Proc. of the 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, January 1998, pages 658-667.
2. N. Alon, S. Dar, M. Parnas, and D. Ron. Testing of clustering. In Proc. of the 41th Ann. IEEE Symp. on Foundations of Computer Science(FOCS) 2000, 240-250.
3. N. Alon and B. Sudakov. On two segmentation problems Journal of Algorithms, 33:173-184, 1999.
4. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comp. System. Sci., 58:193-210, 1999.
5. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. In Proc. of the 30th Ann. ACM Symp. on Theory of Computing, 1998.
6. M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via Core-Sets. Proc. 34th ACM STOC (2002), pages 250-257.
7. Y. Bartal, M. Charikar, and D. Raz. Approximating min-sum k-clustering in metric spaces. In Proc. of the 33rd Ann. ACM Symp. on Theory of Computing, July 2001, pages 11-20.
8. A. Broder, S. Glassman, M. Manasse, and G. Zweig. Syntactic clustering of the Web. In Proc. of the 6th Int'l World Wide Web Conf.(WWW), 1997, pages 391-404.
9. B. Carl and I. Stephani. Entropy, Compactness and the Approximation of Operators. Cambridge University Press, 1990.
10. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proc. of the 40th Ann. IEEE Symp. on Foundations of Computer Science, 1999.
11. M. Charikar, S. Guha, D.B. Shmoys, and É. Tardos. A constant factor approximation algorithm for the k-median problem. In Proc. of the 31st Ann. ACM Symp. on Theory of Computing, 1999.
12. S. Deerwester, S.T. Dumais, T.K. Landauer, G.W. Furnas, and R.A. Harshman. Indexing by latent semantic analysis. Journal of the Society for Information Science, 41(6):391-407, 1990.
13. W. Fernandez de la Vega, M. Karpinski, and C. Kenyon. A polynomial time approximation scheme for metric MIN-BISECTION. ECCC TR02-041, 2002.
14. W. Fernandez de la Vega and C. Kenyon. A randomized approximation scheme for metric MAX CUT. In Proc. of the 39th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), 1998, pages 468-471, also in JCSS 63 (2001). pages 531-541.
15. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In Proc. of the 10th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 1999, pages 291-299.
16. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 3(3):231-262, 1994.
17. N. Garg, V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, 1996.
18. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. J. of the ACM, 45:653-750, 1998.
19. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. In Proc. of the 9th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), January 1998, 649-657.
20. N. Guttmann-Beck and R. Hassin. Approximation algorithms for min-sum p-clustering. Disc. Applied Math., 89:125-142, 1998.
21. P. Indyk. A sublinear time approximation scheme for clustering in metric spaces. In Proc. of the 40th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), 1999, 154-159.
22. K. Jain and V.V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In Proc. of the 40th Ann. IEEE Symp. on Foundations of Computer Science, 1999.
23. V. Kann, S. Khanna, J. Lagergren, and A. Panconesi. On the hardness of approximating Max k-Cut and its dual. In Proc. of the 4th Israeli Symp. on Theory of Computing and Systems (ISTCS), 1996. Also in Chicago Journal of Theoretical Computer Science, 1997.
24. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. In Proc. of the 30th Ann. ACM Symp. on Theory of Computing (STOC), 1998, pages 473-482.
25. N. Mishra, D. Oblinger, and L. Pitt. Sublinear time approximate clustering. In Proc. of the 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), January 2001, pages 439-447.
26. R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric clustering problems. J. of the ACM, 49(2):139-156, March 2002.
27. S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23(3):555-565, 1976.
28. L.J. Schulman. Clustering for edge-cost minimization. In Proc. of the 32nd Ann. ACM Symp. on Theory of Computing (STOC), 2000, pages 547-555.
29. R. Shamir and R. Sharan. Algorithmic approaches to clustering gene expression data. In T. Jiang, T. Smith, Y. Xu, M.Q. Zhang eds., Current Topics in Computational Biology, MIT Press, to appear.
30. M.J. Swain and D.H. Ballard. Color indexing. International Journal of Computer Vision, 7:11-32, 1991.