Abstract
In this paper we prove improved lower and upper bounds for the location of mobile facilities (in L ∞ and L 2 metrics) under the motion of clients when facility moves faster than clients. This paper continues the research started in our joint paper where we present lower bounds and efficient algorithms for exact and approximate maintenance of the 1-center for a set of moving points in the plane. Our algorithms are based on the kinetic framework introduced by Basch, Guibas and Hershberger.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. K. Agarwal and S. Har-Peled. “Maintaining the Approximate Extent Measures of Moving Points”, in Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pp. 148–157, 2001.
P. Agarwal and M. Sharir. “Planar geometric location problems”, Algorithmica, 11, pp. 185–195, 1994.
C. Bajaj “Geometric optimization and computational complexity”, Ph.D. thesis. Tech. Report TR-84–629. Cornell University (1984).
J. Basch, “Kinetic Data Structures”, Ph.D. thesis, Stanford University, USA, 1999.
J. Basch, L. Guibas and J. Hershberger “Data structures for mobile data”, Journal of Algorithms, 31(1), pp. 1–28, 1999.
S. Bespamyatnikh, B. Bhattacharya, D. Kirkpatrick and M. Segal “Mobile facility location”, 4th International ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M for Mobility’00), pp. 46–53, 2000.
S. Bespamyatnikh, K. Kedem and M. Segal “Optimal facility location under various distance functions”, Workshop on Algorithms and Data Structures Lecture Notes in Computer Science 1663, Springer-Verlag, pp. 318–329, 1999.
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, pp. 276–287, 1999.
J. Brimberg and A. Mehrez “Multi-facility location using a maximin criterion and rectangular distances”, Location Science 2, pp. 11–19, 1994.
Z. Drezner “The p-center problem: heuristic and optimal algorithms”, Journal of Operational Research Society, 35, pp. 741–748, 1984.
Z. Drezner “On the rectangular p-center problem”, Naval Res. Logist. Q., 34, pp. 229–234, 1987.
M. Dyer and M. Frieze “A simple heuristic for the p-center problem”, Oper. Res. Lett., 3, pp. 285–288, 1985.
D. Eppstein “Faster construction of planar two-centers”, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, pp. 131–138, 1997.
J. Gao and L. Guibas and J. Hershberger and L. Zhang and A. Zhu “Discrete mobile centers”, In 17th ACM Symposium on Computational Geometry, 2001.
L. Guibas “Kinetic data structures: A state of the art report”, In Proc. 1998 Workshop Algorithmic Found. Robot., pp. 191–209, 1998.
S. L. Hakimi, M. Labbe and E. Schmeichel “Locations on Time-Varying Networks”, Networks, Vol. 34 (4), pp. 250–257, 1999.
Sariel Har-Peled “Clustering motion”, FOCS’2001.
D. Hochbaum and D. Shmoys “A best possible approximation algorithm for the k-center problem”, Math. Oper. Res., 10, pp. 180–184, 1985.
D. Hochbaum and A. Pathria “Locating Centers in a Dynamically Changing Network and Related Problems”, Location Science, 6, pp. 243–256, 1998.
Hai Huang and Andrea Richa and Michael Segal “Approximation algorithms for mobile piercing set problem with applications to clustering”, Technical report, Arizona State University, 2001.
J. Jaromczyk and M. Kowaluk, “An efficient algorithm for the Euclidean two-center problem”, in Proc. 10th ACM Sympos. Comput. Geom., pp. 303–311, 1994.
H. Kuhn, “A note on Fermat’s problem”, Mathematical Programming, 4, pp. 98–107, 1973.
N. Megiddo “Linear time algorithms for linear programming in R3 and related problems”, SIAM J. Comput., 12, pp. 759–776, 1983.
M. Manasse, L. McGeoch and D. Sleator “Competitive algorithms for server problems”, Journal of Algorithms, 11, pp. 208–230, 1990.
N. Megiddo and A. Tamir “New results on the complexity of p-center problems”, SIAM J. Comput., 12 (4), pp. 751–758, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bespamyatnikh, S., Bhattacharya, B., Kirkpatrick, D., Segal, M. (2002). Lower and Upper Bounds for Tracking Mobile Users. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive