New algorithms for k-center and extensions

Journal of Combinatorial Optimization

Volumn 18, Issue 4, 2009, Pages 376-392

  Brandenberg, René ^a   Roth, Lucia ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

2 SAT; Approximation algorithms; Branch and bound; Computational geometry; Containment; Core sets; Diameter partition; Geometric inequalities; K center; SOCP

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY;

2-SAT; BRANCH AND BOUNDS; CONTAINMENT; CORE SET; DIAMETER PARTITION; GEOMETRIC INEQUALITIES; K-CENTER; SOCP;

CONTAINERS;

EID: 84898011546     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-009-9226-9     Document Type: Article

References (40)

1. Agarwal PK, Procopiuc CM (1998) Exact and approximation algorithms for clustering. In: Proc 9th ACMSIAM symp discrete alg, pp 658-667
2. Agarwal PK, Sharir M (1998) Efficient algorithms for geometric optimization. ACM Comput Surv 30(4):412-458
3. Anderberg MR (1973) Cluster analysis for applications. In: Probability and mathematical statistics. Academic Press, London
4. Avis D (1986) Diameter partitioning. Discrete Comput Geom 1:265-276
5. Bespamyatnikh S, Kirkpatrick D (1999) Rectilinear 2-center problems. In: Proc 11th Canad conf comp geom, pp 68-71
6. Bespamyatnikh S, Segal M (2000) Covering a set of points by two axis-parallel boxes. Inf Process Lett 75(3):95-100
7. Bohnenblust HF (1938) Convex regions and projections in Minkowski spaces. Ann Math 39:301-308
8. Boltyanski V, Martini H, Soltan PS (1997) Excursions into combinatorial geometry. Springer, Berlin
9. Brandenberg R, Gerken T, Gritzmann P, Roth L (2008) Modeling and optimization of correction measures for human extremities. In: Jäger W, Krebs H-J (eds) Mathematics - key technology for the future. Joint projects between universities and industry 2004-2007. Springer, Berlin, pp 131-148
10. Brandenberg R, Roth L (2009) Optimal containment under homothetics. A simple cutting plane approach. Comput Optim Appl (to appear).
11. Bädoiu M, Har-Peled S, Indyk P (2002) Approximate clustering via core-sets. In: Proc 34th annu ACM symp theor comput, pp 250-257
12. Bunschoten R (1999) A fully vectorized function that computes the Euclidean distance matrix between two sets of vectors. Via http://www.mathworks. com/matlabcentral/fileexchange/loadFile.do?objectId=71
13. Chan TM (1999) More planar two-center algorithms. Comput Geom Theory Appl 13(3):189-198
14. Eppstein D (1997) Faster construction of planar two-centers. In: Proc 8th ACM-SIAM symp discrete alg, pp 131-138
15. Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293-306
16. Gritzmann P, Klee V (1992) Inner and outer j-radii of convex bodies in finite-dimensional normed spaces. Discrete Comput Geom 7:255-280
17. Gritzmann P, Klee V (1994) On the complexity of some basic problems in computational convexity I: Containment problems. Discrete Math 136:129-174
18. Halperin D, Sharir M, Goldberg K (2002) The 2-center problem with obstacles. J Algebra 42(1):109-134
19. Hartigan JA (1975) Clustering algorithms. Wiley series in probability and mathematical statistics. Wiley, New York
20. Helly E (1923) Über Mengen konvexer Körper mit gemeinschaftlichen Punkten. Jahresbericht Deutsch Math Verein 32:175-176
21. Hershberger J (1993) A faster algorithm for the two-center decision problem. Inf Process Lett 47(1):23-29
22. Hoffmann M (2005) A simple linear algorithm for computing rectilinear 3-centers. Comput Geom Theory Appl 31(3):150-165
23. Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall, Englewood Cliffs
24. Jaromczyk JW, Kowaluk M (1994) An efficient algorithm for the Euclidean two-center problem. In: Symp comp geom, pp 303-311
25. John F (1948) Extremum problems with inequalities as subsidiary conditions. In: Courant anniversary volume. Interscience, New York, pp 187-204
26. Jung HWE (1901) Über die kleinste Kugel, die eine räumliche Figur einschließt. J Reine Angew Math 123:241-257
27. Kumar P (2004) Clustering and reconstructing large data sets. PhD thesis, Department of Computer Science, Stony Brook University
28. Kumar P, Mitchell JSB, Yildirim EA (2003) Approximate minimum enclosing balls in high dimensions using core-sets. J Exp Algorithm 8
29. Kumar P, Mitchell JSB, Yildirim EA (2003) Minimum enclosing balls: Matlab code. http://www.compgeom.com/-piyush/
30. Leichtweiß K (1955) Zwei Extremalprobleme der Minkowski-Geometrie. Math Z 62:37-49
31. Mangasarian OL, Setiono R, Wolberg WH (1990) Pattern recognition via linear programming: theory and application to medical diagnosis. In: Coleman TF, Li Y (eds) Large-scale numerical optimization. Computer sciences TR, vol 878. SIAM, Philadelphia, pp 22-31
32. Megiddo N (1990) On the complexity of some geometric problems in unbounded dimension. J Symb Comput 10(3/4):327-334
33. Pólik I (2005) Addendum to the sedumi user guide version 1.1. Technical report, Advanced Optimization Laboratory, McMaster University
34. Procopiuc CM (1997) Clustering problems and their applications: a survey. Department of Computer Science, Duke University
35. Sharir M (1996) A near-linear algorithm for the planar 2-center problem. In: Proc symp comp geom, pp 106-112
36. Sturm JF (1999) Using SEDUMI 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw 11-12:625-653
37. Toh KC, Todd MJ, Tütüncü RH (1999) SDPT3 - a Matlab software package for semidefinite programming. Optim Methods Softw 11:545-581
38. Tütüncü RH, Toh KC, Todd MJ (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Math Program Ser B 95:189-217
39. del Val A (2000) On 2-SAT and renamable Horn. In: Proc 17th nat conf on artif intel. AAAI/MIT Press, Menlo Park/Cambridge, p 111
40. Wei H, Murray AT, Xiao N (2006) Solving the continuous space p-centre problem: planning application issues. IMA J Manag Math 17:413-425