Mobile Networks and Applications

, Volume 11, Issue 2, pp 177–186

Competitive Algorithms for Maintaining a Mobile Center

  • Sergey Bereg
  • Binay Bhattacharya
  • David Kirkpatrick
  • Michael Segal

DOI: 10.1007/s11036-006-4470-z

Cite this article as:
Bereg, S., Bhattacharya, B., Kirkpatrick, D. et al. Mobile Netw Appl (2006) 11: 177. doi:10.1007/s11036-006-4470-z


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.


approximation algorithmsfacility locationonline strategies

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Sergey Bereg
    • 1
  • Binay Bhattacharya
    • 2
  • David Kirkpatrick
    • 3
  • Michael Segal
    • 4
  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  2. 2.School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  3. 3.Department of Computer ScienceUniversity of British ColumbiaVancouverCanada
  4. 4.Communication Systems Engineering DepartmentBen-Gurion University of the NegevBeer-ShevaIsrael