Faster construction of planar two-centers
David Eppstein
Proc. 8th Symp. Discrete Algorithms, ACM
and SIAM, Jan 1997, pp. 131–138
Tech. report 96-12, Univ. of California, Irvine, Dept. of Information and Computer Science, 1996
http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-12.pdf
http://www.ics.uci.edu/~eppstein/pubs/Epp-SODA-97.pdf
Cited by:
- A near-linear algorithm for the planar 2-center problem
- Efficient algorithms for geometric optimization
- The discrete 2-center problem
- Geometric applications of a randomized optimization technique
- Computational Geometry II
- Two-center problems for a convex polygon
- Obnoxious facility location: complete service with minimal harm
- Constrained square center problems
- Rectilinear static and dynamic discrete 2-center problems
- More planar two-center algorithms
- Computing a double-ray center for a planar point set
- Approximation algorithms for projective clustering
- On the continuous Weber and $k$-median problems
- The 2-center problem with obstacles
- Discrete rectilinear 2-center problems
- A geometric proof of the combinatorial bounds for the number of optimal solutions for the 2-center Euclidean problem
- Efficient algorithms for two-center problems for a convex polygon
- A near-quadratic algorithm for the alpha-connected two-center decision problem
- Efficiently approximating polygonal paths in three and higher dimensions
- A fast algorithm for the alpha-connected two-center decision problem
- Mobile facility location
- ShareCam part II: approximate and distributed algorithms for a collaboratively controlled robotic webcam
- Exact and distributed algorithms for collaborative camera control
- Algorithms for disk covering problems with the most points
- Collaborative frame selection: exact and distributed algorithms for a networked robotic camera with discrete zoom levels
