An efficient algorithm for 2D Euclidean 2-center with outliers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5193 LNCS, Issue , 2008, Pages 64-75

  Agarwal, Pankaj K ^a   Phillips, Jeff M ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CENTER PROBLEMS; EUCLIDEAN; EXPECTED RUNNING TIME; K POINTS; RANDOMIZED ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 57749189543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_6     Document Type: Conference Paper

References (25)

1. Agarwal, P.K., Matoušek, J.: Dynamic half-space range reporting and its applications. Algorithmica 13, 325-345 (1995)
2. Agarwal, P.K., Phillips, J.M.: An efficient algorithm for 2D Euclidean 2-center with outliers (2008) arXiV:0806.4326
3. Agarwal, P.K., Sharir, M.: Planar geometric locations problems. Algorithmica 11, 185-195 (1994)
4. Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Computing Surveys 30, 412-458 (1998)
5. Aggarwal, A., Guibas, L.J., Saxe, J., Shor, P.W.: A linear-time algorithm for computing the voronoi diagram of a convex polygon. Discrete Comput. Geom. 4, 591-604 (1989)
6. Chan, T.: More planar two-center algorithms. Comput. Geom.: Theory Apps. 13, 189-198 (1999)
7. Chan, T.: Low-dimensional linear programming with violations. SIAM J. Comput. 34, 879-893 (2005)
8. Chan, T.: On the bichromatic k-set problem. In: Proc. 19th Annu. ACM-SIAM Sympos. Discrete Algs., pp. 561-570 (2007)
9. Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for faciity location problems with outliers. In: 12th Annu. ACM-SIAM Sympos. on Discrete Algs., pp. 642-651 (2001)
10. Clarkson, K.L.: A bound on local minima of arrangements that implies the upper bound theorem. Discrete Comput. Geom. 10, 427-433 (1993)
11. Clarkson, K.L., Shor, P.W.: Applications of random sampling in geometry, II. Discrete Comput. Geom. 4, 387-421 (1989)
12. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of ACM 34, 200-208 (1987)
13. Dey, T.K.: Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19, 373-382 (1998)
14. Drezner, Z., Hamacher, H.: Facility Location: Applications and Theory. Springer, Heidelberg (2002)
15. Eppstein, D.: Faster construction of planar two-centers. In: Proc. 8th Annu. ACM-SIAM Sympos. on Discrete Algs., pp. 131-138 (1997)
16. Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in x+y and matrices with sorted columns. J. Comput. Syst. Sci. 24, 197-208 (1982)
17. Gusfield, D.: Bounds for the parametric minimum spanning tree problem. In: Humboldt Conf. on Graph Theory, Combinatorics Comput., pp. 173-183. Utilitas Mathematica (1979)
18. Hochbaum, D.S. (ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company (1995)
19. Matoušek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14, 365-384 (1995)
20. Matoušek, J., Welzl, E., Sharir, M.: A subexponential bound for linear programming and related problems. Algorithmica 16, 498-516 (1996)
21. 3 and related problems. SIAM J. Comput. 12, 759-776 (1983)
22. Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 12, 759-776 (1983)
23. Sharir, M.: On k-sets in arrangement of curves and surfaces. Discrete Comput. Geom. 6, 593-613 (1991)
24. Sharir, M.: A near-linear time algorithm for the planar 2-center problem. Discrete Comput. Geom. 18, 125-134 (1997)
25. Sharir, M., Welzl, E.: Rectilinear and polygonal p-piercing and p-center problems. In: Proc. 12th Annu. Sympos. Comput. Geom., pp. 122-132 (1996)