Competitive Algorithms for Maintaining a Mobile Center
- First Online:
- 57 Downloads
In this paper we investigate the problem of locating a mobile facility at (or near) the center of a set of clients that move independently, continuously, and with bounded velocity. It is shown that the Euclidean 1-center of the clients may move with arbitrarily high velocity relative to the maximum client velocity. This motivates the search for strategies for moving a facility so as to closely approximate the Euclidean 1-center while guaranteeing low (relative) velocity.
We present lower bounds and efficient competitive algorithms for the exact and approximate maintenance of the Euclidean 1-center for a set of moving points in the plane. These results serve to accurately quantify the intrinsic velocity approximation quality tradeoff associated with the maintenance of the mobile Euclidean 1-center.
Keywordsapproximation algorithms facility location online strategies
Unable to display preview. Download preview PDF.
- P.K. Agarwal, J. Gao and L.J. Guibas, Kinetic medians and kd-trees, in: Proc. 10th Annual European Symposium on Algorithms, LNCS 2461 (2002) pp. 5–16.Google Scholar
- P.K. Agarwal and S. Har-Peled, Maintaining the approximate extent measures of moving points, in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (2001) pp. 148–157.Google Scholar
- S. Arora, P. Raghavan and S. Rao, Polynomial time approximation schemes for Euclidean k-medians and related problems, in: Proc. 31st ACM Symp. on Theory of Comput. (1998) pp. 106–113.Google Scholar
- C. Bajaj, Geometric optimization and computational complexity, Ph.D. thesis. Tech. Report TR-84-629. Cornell University (1984).Google Scholar
- J. Basch, Kinetic data structures, Ph.D. thesis, Stanford University, USA (1999).Google Scholar
- S. Bespamyatnikh, B. Bhattacharya, D. Kirkpatrick and M. Segal, Mobile facility location, in: Proc. of 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIAL M (2000) pp. 46–53.Google Scholar
- S. Bespamyatnikh, K. Kedem and M. Segal, Optimal facility location under various distance functions, in Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 1663 (Springer-Verlag, 1999) pp. 318–329.Google Scholar
- S. Bespamyatnikh and M. Segal, Rectilinear static and dynamic center problems, Workshop on Algorithms and Data Structures Lecture Notes in Computer Science 1663 (Springer-Verlag, 1999) pp. 276–287.Google Scholar
- M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, in: Proc. 40th Symp. on Found. of Comput. Science (1999) pp. 378–388.Google Scholar
- M. Charikar, S. Guha, E. Tardos and D. Shmoys, A constant-factor approximation algorithm for the k-median problem, in: Proc. 32th ACM Symp. on Theory of Comput. (1999) pp. 106–113.Google Scholar
- S. Durocher and D. Kirkpatrick, The Gaussian center of a set of points with applications to mobile facility location, submitted for publication. (See Proc. 15th Canadian Conference on Computational Geometry, 2003, for a preliminary version.)Google Scholar
- D. Eppstein, Faster construction of planar two-centers, in: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (1997) pp. 131–138.Google Scholar
- J. Gao, L. Guibas and A. Nguen, Deformable spanners and applications, ACM Sympos. Comp. Geom. (2004) 190–199.Google Scholar
- L. Guibas, Kinetic data structures: A state of the art report, in: Proc. 1998 Workshop Algorithmic Found. Robot. (1998) pp. 191–209.Google Scholar
- K. Jain and V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, in: Proc. 40th Symp. on Found. of Comput. Science (1999) pp. 2–13.Google Scholar
- J. Jaromczyk and M. Kowaluk, An efficient algorithm for the Euclidian two-center problem, in: Proc. 10th ACM Sympos. Comput. Geom. (1994) pp. 303–311.Google Scholar