A (1+ε)-approximation algorithm for 2-line-center

Computational Geometry: Theory and Applications

Volumn 26, Issue 2, 2003, Pages 119-128

  Agarwal, Pankaj K ^a   Procopiuc, Cecilia M ^b   Varadarajan, Kasturi R ^c  

^a Duke University   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c University of Iowa   (United States)

Author keywords

2 line center problem; Approximation algorithms; Projective clustering; Shape fitting

Indexed keywords

EID: 84867923722     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(03)00017-8     Document Type: Article

References (15)

1. P.K. Agarwal, and J. Erickson Geometric range searching and its relatives B. Chazelle, J.E. Goodman, R. Pollack, Advances in Discrete and Computational Geometry Contemporary Mathematics 223 1999 1 56
2. P.K. Agarwal, and C.M. Procopiuc Approximation algorithms for projective clustering Proc. 11th ACM-SIAM Sympos. Discrete Algorithms 2000 538 547
3. P.K. Agarwal, C.M. Procopiuc, and K.R. Varadarajan Approximation algorithms for k-line-center Proc. 8th European Sympos. Algorithms 2002 54 63
4. P.K. Agarwal, and M. Sharir Efficient randomized algorithms for some geometric optimization problems Discrete Comput. Geom. 16 1996 317 337
5. T.M. Chan Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus Proc. 16th Annu. ACM Sympos. Comput. Geom. 2000 300 309
6. C.A. Duncan, M.T. Goodrich, and E.A. Ramos Efficient approximation and optimization algorithms for computational metrology Proc. 8th ACM-SIAM Sympos. Discrete Algorithms 1997 121 130
7. A. Glozman, K. Kedem, and G. Shpitalnik On some geometric selection and optimization problems via sorted matrices Proc. 4th Workshop Algorithms Data Struct. Lecture Notes Comput. Sci. 955 1995 Springer Berlin 26 37
8. S. Har-Peled Clustering motion Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci. 2001 84 93
9. M.E. Houle, and G.T. Toussaint Computing the width of a set IEEE Trans. Pattern Anal. Mach. Intell. PAMI-10 5 1988 761 765
10. P. Indyk, R. Motwani, P. Raghavan, and S. Vempala Locality-preserving hashing in multidimensional spaces Proc. 29th Annu. ACM Sympos. Theory Comput. 1997 618 625
11. J.W. Jaromczyk, and M. Kowaluk The two-line center problem from a polar view: A new algorithm and data structure Proc. 4th Workshop Algorithms Data Struct. Lecture Notes Comput. Sci. 955 1995 Springer Berlin 13 25
12. D. Kirkpatrick, and J. Snoeyink Tentative prune-and-search for computing fixed-points with applications to geometric computation Fund. Inform. 22 1995 353 370
13. D.T. Lee, and Y.F. Wu Geometric complexity of some location problems Algorithmica 1 1986 193 211
14. N. Megiddo, and A. Tamir On the complexity of locating linear facilities in the plane Oper. Res. Lett. 1 1982 194 197
15. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 3rd Edition 1990 Springer Berlin