On clustering to minimize the sum of radii

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 819-825

  Gibson, Matt ^a   Kanade, Gaurav ^a   Krohn, Erik ^a   Pirwani, Imran A ^a   Varadarajan, Kasturi ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (13)

1. S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the IEEE Symposium on Foundations of Computer Science, 1996, 2-12.
2. H. Alt, E. Arkin, H. Bronnimann, J. Erickson, S. Fekete, C. Knauer, J. Lenchner, J. Mitchell, and K. Whittlesey. Mininum-cost coverage of points by disks. Proceedings of the Annual Symposium on Computational Geometry, 2006, 449-458.
3. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1996, 184-193.
4. M. Bern and D. Eppstein. Approximation algorithms for geometric problems. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems, PWS Publishing Company, 1997, pages 296-345.
5. V. Bilo, I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Geometric clustering to minimize the sum of cluster sizes. Proceedings of the European Symposium on Algorithms, LNCS vol 3669, 460-471, 2005.
6. M. Charikar and R. Panigrahy. Clustering to minimize the sum of cluster diameters. Journal of Computer and Systems Sciences, vol. 68 (2), 417-441, 2004.
7. E. D. Demaine, J. S. B. Mitchell, and J. O'Rourke. The open problems project, Problem 33: Sum of square roots, http://maven.smith.edu/ ̃orourke/TOPP/P33-html.
8. S. R. Doddi, M. V. Marathe, S. S. Ravi, D. S. Taylor, and P. Widmayer. Approximation algorithms for clustering to minimize the sum of diameters. Nordic Journal of Computing, Vol 7(3), 185-203, 2000.
9. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics, Proceedings of the ACM Symposium on the Theory of Computing, 2003, 448-455.
10. M. Gibson, G. Kanade, E. Krohn, I. Pirwani, and K. Varadarajan. On metric clustering to minimize the sum of radii. Manuscript, 2007.
11. N. Lev-Tov and D. Peleg. Polynomial time approximation schems for base station coverage with minimum total radii. Computer Networks 47 (2005) 489-501.
12. J. S. B. Mitchell. Guillotine subdivisions aprpoximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing, 28(4): 1298-1309.
13. J. Qian and C. A. Wang. How much precision is needed to compare two sums of square roots of integers?, Information Processing Letters 100 (2006): 194-198.