Almost optimal solutions to k-clustering problems

International Journal of Computational Geometry and Applications

Volumn 20, Issue 4, 2010, Pages 431-447

  Kumar, Pankaj ^a   Kumar, Piyush ^b  

^a Purdue University   (United States)

^b Florida State University   (United States)

Author keywords

clustering; core sets; k center; optimization

Indexed keywords

EID: 77956520991     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195910003372     Document Type: Article

References (52)

1. P. K. Agarwal and C. M. Procopiuc, Exact and approximation algorithms for clustering, Proc. 9th ACM-SIAM Symp. Discrete Algorithms, (1998), pp. 658-667.
2. P. K. Agarwal and C. M. Procopiuc, Approximation algorithms for projective clustering, J. Algorithms 46(2) (2003) 115-139.
3. P. K. Agarwal and C. M. Procopiuc, Approximation algorithms for projective clustering, Symp. Discrete Algorithms, (2000), pp. 538-547.
4. P. K. Agarwal, C. M. Procopiuc and K. R. Varadarajan, Approximation algorithms for k-line center, ESA '02: Proc. 10th Ann. European Symp. Algorithms (Springer-Verlag, London, UK, 2002), pp. 54-63.
5. P. K. Agarwal and M. Sharir, Ecient algorithms for geometric optimization, ACM Comput. Surv. 30(4) (1998) 412-458.
6. E. Assa and M. J. Katz, 3-piercing of d-dimensional boxes and homothetic triangles, Int. J. Comput. Geom. Appl. 9(3) (1999) 249-259.
7. M. Badoiu and K. L. Clarkson, Smaller core-sets for balls, Proc. 14th Ann. ACM- SIAM Symp. Discrete Algorithms, (2003), pp. 801-802.
8. M. Badoiu, S. Har-Peled and P. Indyk, Approximate clustering via core-sets, Proc. 34th Ann. ACM Symp. Theory of Computing, (2002), pp. 250-257.
9. H. Brönnimann and M. T. Goodrich, Almost optimal set covers in nite vc-dimension: (preliminary version), SCG '94: Proc. Tenth Ann. Symp. Computational Geometry, (ACM Press, 1994), pp. 293-302.
10. Y. Bulatov, S. Jambawalikar, P. Kumar and S. Sethia, Hand recognition using geometric classi ers, Proc. Int. Conf. Biometric Authentication, Lecture Notes Comput. Sci., Vol.3072 (Springer-Verlag, 2004), pp. 753-759.
11. T. M. Chan, Faster core-set constructions and data stream algorithms in xed dimensions, SCG '04: Proc. Twentieth Ann. Symp. Computational Geometry (ACM Press, 2004), pp. 152-159.
12. S. W. Cheng, S. Funke, M. Golin, P. Kumar, S. Poon and E. Ramos, Curve reconstruction from noisy samples, Proc. 19th Ann. ACM Symp. Computational Geometry, (2003), pp. 302-311.
13. K. L. Clarkson, Las vegas algorithms for linear and integer programming when the dimension is small, J. ACM 42(2) (1995) 488-499.
14. N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods (Cambridge University Press, 2000).
15. G. B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Oper. Res. 8 (1960) 101-111.
16. Z. Drezner, The p-center problem, European J. Oper. Res. 26(2) (1986) 312-313.
17. M. E. Dyer, On a multidimensional search technique and its application to the euclidean one centre problem, SIAM J. Comput. 15(3) (1986) 725-738.
18. D. Eberly, 3D Game Engine Design (Morgan Kaufmann, 2001).
19. D. Eppstein, Faster construction of planar two-centers, Proc. 8th ACM-SIAM Symp. Discrete Algorithms (1997).
20. T. Feder and D. H. Greene, Optimal algorithms for approximate clustering, Proc. 20th Ann. ACM Symp. Theory of Comp. (ACM, 1988), pp. 434-444.
21. K. Fischer, B. Grtner, T. Herrmann, M. Ho mann, E. Packer and S. Schnherr, Geometric optimization, CGAL User and Reference Manual, 3.3 edition, 2007.
22. B. Gärtner, A subexponential algorithm for abstract optimization problems, SIAM J. Comput. 24 (1995) 1018-1035.
23. B. Gärtner and S. Schönherr, Anecient, exact, and generic quadratic programming solver for geometric optimization, Proc. 16th Ann. ACM Symp. Comput. Geom., (2000), pp. 110-118.
24. T. F. Gonzalez, Clustering to minimize the maximum intercluster distance, Theoret. Comput. Sci. 38 (1985) 293-306.
25. D. Halperin, M. Sharir and K. Goldberg, The 2-center problem with obstacles, Proc. 16th Annu. ACM Symp. Comput. Geom., (2000), pp. 80-90.
26. M. Ho mann, A simple linear algorithm for computing rectangular three-centers, Proc. 11th Canadian Conf. Computational Geometry (CCCG '99), Vancouver(BC), Canada, (1999), pp. 72-75.
27. P. M. Hubbard, Approximating polyhedra with spheres for time-critical collision detection, ACM Trans. Graph. 15(3) (1996) 179-210.
28. R. Z. Hwang, R. C. Chang and R. C. T. Lee, The searching over separators strategy to solve some NP-hard problems in subexponential time, Algorithmica 9 (1993) 398-423.
29. A. K. Jain, M. N. Murty and P. J. Flynn, Data clustering: a review, ACM Comput. Surveys 31(3) (1999) 264-323.
30. M. J. Katz and M. Sharir, An expander-based approach to geometric optimization, SIAM J. Comput. 26 (1997) 1384-1408.
31. J. T. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral and K. Zikan, Ecient collision detection using bounding volume hierarchies of k-DOPs, IEEE Trans. Visualiz. Comput. Graph. 4(1) (1998) 21-36.
32. M. T. Ko and Y. T. Ching, A linear time algorithm for the weighted rectilinear 2-center problem, Proc. Int. Workshop on Discrete Algorithms and Complexity, Fukuoka, Japan, 1989. Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo, pp. 75-82.
33. B. Kreuter and T. Nierho , Greedily approximating the r-independent set and kcenter problems on random instances, Proc. First Int. Workshop on Randomization and Approximation Techniques in Computer Science (Random 97), ed. J. Rolim, LNCS, Vol.1269 (Springer, 1997), pp. 43-53. http://www.informatik.hu- berlin. de/̃nierhoff/pubs/greedy.html.
34. P. Kumar, J. S. B. Mitchell and A. Yildirim, Approximate minimum enclosing balls in high dimensions using core-sets, The ACM J. Experim. Algorith. 8 (2003).
35. J. Matousek, M. Sharir and E.Welzl, A subexponential bound for linear programming, Proc. 8th Ann. ACM Symp. Comput. Geom. (1992), pp. 1-8.
36. N. Megiddo and K. J. Supowit, The complexity of some common geometric location problems, SIAM J. Computing 13(1) (1984) 182-196.
37. N. Megiddo and A. Tamir, On the complexity of locating linear facilities in the plane, Operat. Res. Lett. 13 (1982) 194-197.
38. A. Mhatre and P. Kumar, Projective clustering and its application to surface reconstruction: extended abstract, SCG '06: Proc. Twenty-second Ann. Symp. Computa- tional Geometry (ACM Press, New York, NY, USA, 2006), pp. 477-478.
39. J. Mihelic and B. Robic, Approximation algorithms for k-center problem: an experimental evaluation, Proc. OR 2002, Klagenfurt, Austria, 2002.
40. J. Pitt-Francis and R. Featherstone, Automatic generation of sphere hierarchies from cad data, Proc. Int. Conf. Robotics and Automation, (1998), pp. 324-329. http:// users.comlab.ox.ac.uk/joe.pitt-francis/icra.ps.gz.
41. J. Platt, Sequential minimal optimization: A fast algorithm for training support vector machines (1998).
42. G. Reinelt, TSPLIB | a traveling salesman problem library, ORSA J. Comput. 3 (1991) 376-384.
43. J. Robert and G. Toussaint, Computational geometry and facility location, Technical Report SOCS 90.20, McGill Univ., Montreal, PQ, 1990.
44. S. Rusinkiewicz and M. Levoy, QSplat: A multiresolution point rendering system for large meshes, Computer Graphics Proc., Ann. Conf. Series (SIGGRAPH 2000), August 2000.
45. M. Sharir, A near-linear algorithm for the planar 2-center problem, Proc. 12th Ann. ACM Symp. Comput. Geom., (1996), pp. 106-112.
46. M. Sharir and E. Welzl, Rectilinear and polygonal p-piercing and p-center problems, Proc. 12th Ann. ACM Symp. Comput. Geom., (1996), pp. 122-132.
47. D. Spielman and S.-H. Teng, Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time, Proc. Thirty-third Ann. ACM Symp. Theory of Computing, (2001), pp. 296-305.
48. G. T. Toussaint, Solving geometric problems with the rotating calipers, Proc. IEEE MELECON '83, (1983), pp. A10.02/1-4.
49. V. Vazirani, Approximation Algorithms (Springer-Verlag, 2001).
50. E. Welzl, Partition trees for triangle counting and other range searching problems, Proc. 4th Ann. ACM Symp. Comput. Geom., (1988), pp. 23-33.
51. B. Xiao, Q. Zhuge, Y. He, Z. Shao and E. Sha, Algorithms for disk covering problems with the most points, Proc. IASTED Int. Conf. Parallel and Distributed Computing and Systems (IASTED PDCS), (2003), pp. 541-546.
52. H. Yu, P. K. Agarwal, R. Poreddy and K. R. Varadarajan, Practical methods for shape tting and kinetic data structures using core sets, SCG '04: Proc. Twentieth Ann. Symp. Computational Geometry (ACM Press, 2004), pp. 263-272.