2008 · 40 citations · 16 references
ComputingComputer ScienceFacility LocationGeometric ModelingMobile ComputingLocation AnalysisPoint LocationFacility Location ApproximationLower BoundsMedian-center ProblemMedian-center Trade-off ModelsMobile Facility Location
In this paper we investigate the location of mobile facilities (in L1 and L2 metrics) under the motion of clients. In particular, we present lower bounds and efficient algorithms for exact and approximate maintenance of the 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. [6].
16
Competitive algorithms for server problems
Mark S. Manasse, Lyle A. McGeoch, Daniel D. Sleator · Journal of Algorithms · 1990 · 431 citations
Data Structures for Mobile Data
1997 · 351 citations