Lower and upper bounds for tracking mobile users

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 47-58

  Bespamyatnikh, Sergei ^a   Bhattacharya, Binay ^b   Kirkpatrick, David ^c   Segal, Michael ^d  

^a Duke University   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION TECHNOLOGY;

LOWER AND UPPER BOUNDS; LOWER BOUNDS; MOBILE FACILITY; TRACKING MOBILE USERS;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 84891128690     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_5     Document Type: Article

References (25)

1. 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.
2. P. Agarwal and M. Sharir. Planar geometric location problems, Algorithmica, 11, pp. 185-195, 1994.
3. C. Bajaj Geometric optimization and computational complexity, Ph.D. thesis. Tech. Report TR-84-629. Cornell University (1984).
4. J. Basch, Kinetic Data Structures, Ph.D. thesis, Stanford University, USA, 1999.
5. J. Basch, L. Guibas and J. Hershberger Data structures for mobile data, Journal of Algorithms, 31(1), pp. 1-28, 1999.
6. 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 Mobility00), pp. 46-53, 2000.
7. 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.
8. 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.
9. J. Brimberg and A. Mehrez Multi-facility location using a maximin criterion and rectangular distances, Location Science 2, pp. 11-19, 1994.
10. Z. Drezner The p-center problem: heuristic and optimal algorithms, Journal of Operational Research Society, 35, pp. 741-748, 1984.
11. Z. Drezner On the rectangular p-center problem, Naval Res. Logist. Q., 34, pp. 229-234, 1987.
12. M. Dyer and M. Frieze A simple heuristic for the p-center problem, Oper. Res. Lett, 3, pp. 285-288,1985.
13. D. Eppstein Faster construction of planar two-centers, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, pp. 131-138, 1997.
14. 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.
15. L. Guibas Kinetic data structures: A state of the art report, In Proc. 1998 Workshop Algorithmic Found. Robot, pp. 191-209, 1998.
16. S. L. Hakimi, M. Labbe and E. Schmeichel Locations on Time-Varying Networks, Networks, Vol. 34(4), pp. 250-257, 1999.
17. Sariel Har-Peled Clustering motion, FOCS 2001.
18. D. Hochbaum and D. Shmoys A best possible approximation algorithm for the fc-center problem, Math. Oper. Res., 10, pp. 180-184, 1985.
19. D. Hochbaum and A. Pathria Locating Centers in a Dynamically Changing Network and Related Problems, Location Science, 6, pp. 243-256, 1998.
20. 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.
21. J. Jaromczyk and M. Kowaluk, An efficient algorithm for the Euclidean two-center problem, in Proc. 10th ACMSympos. Comput. Geom., pp. 303-311, 1994.
22. H. Kuhn, A note on Fermat's problem, Mathematical Programming, 4, pp. 98-107, 1973.
23. N. Megiddo Linear time algorithms for linear programming in R3 and related problems, SIAM J. Comput, 12, pp. 759-776, 1983.
24. M. Manasse, L. McGeoch and D. Sleator Competitive algorithms for server problems, Journal of Algorithms, 11, pp. 208-230, 1990.
25. N. Megiddo and A. Tamir New results on the complexity of p-center problems, SIAM J. Comput, 12(4), pp. 751-758, 1983.