Mobile facility location (extended abstract)

Authors:
S. Bespamyatnikh;B. Bhattacharya;D. Kirkpatrick;M. Segal
Affiliations:
Department of Computer Science, University of British Columbia, Vancouver, Canada;School of Computing Science, Simon Fraser University, Burnaby, Canada;Department of Computer Science, University of British Columbia, Vancouver, Canada;Department of Computer Science, University of British Columbia, Vancouver, Canada
Venue:
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Year:
2000

Citing 12
Cited 19

Competitive algorithms for server problems

Journal of Algorithms
Approximation algorithms for geometric median problems

Information Processing Letters
An efficient algorithm for the Euclidean two-center problem

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Approximation schemes for Euclidean k-medians and related problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Kinetic data structures: a state of the art report

WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
A constant-factor approximation algorithm for the k-median problem (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Faster construction of planar two-centers

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Data structures for mobile data

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Geometric Optimization and Computational Complexity

Geometric Optimization and Computational Complexity
Kinetic data structures

Kinetic data structures

Discrete mobile centers

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Smooth kinetic maintenance of clusters

Proceedings of the nineteenth annual symposium on Computational geometry
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Smooth kinetic maintenance of clusters

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Perturbation of Sets and Centers

Journal of Global Optimization
Competitive algorithms for maintaining a mobile center

Mobile Networks and Applications
Nomadic Service Assignment

IEEE Transactions on Mobile Computing
Kinetic mobility management applied to vehicular ad hoc network protocols

Computer Communications
The Kinetic Facility Location Problem

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Kinetic maintenance of mobile k-centres on trees

Discrete Applied Mathematics
The projection median of a set of points

Computational Geometry: Theory and Applications
Smooth kinetic maintenance of clusters

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Kinetic maintenance of mobile k-centres on trees

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Contention-aware data caching in wireless multi-hop ad hoc networks

Journal of Parallel and Distributed Computing
Minimum enclosing circle of a set of fixed points and a mobile point

WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Minimizing movement in mobile facility location problems

ACM Transactions on Algorithms (TALG)
The Mobile Facility Routing Problem

Transportation Science
Gossip-based cooperative caching for mobile applications in mobile wireless networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the location of mobile facilities (in L∞ and L2 metric) under the motion of clients. In particular, we present lower bounds and efficient algorithms for exact and approximate maintenance of 1-center and 1-median for a set of moving points in the plane. Our algorithms are based on the kinetic framework introduced by Basch et. al [5].