<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05938287</id>
  <dt>a</dt>
  <an>05938287</an>
  <augroup>
    <au>Eppstein, David</au>
    <au>Goodrich, Michael T.</au>
    <au>L\"offler, Maarten</au>
  </augroup>
  <ti>Tracking moving objects with few handovers.</ti>
  <so>Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15--17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 362-373 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-22300-6_31</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We study the online problem of assigning a moving point to a base-station region that contains it. Our goal is to minimize the number of handovers that occur when the point moves outside its assigned region and must be assigned to a new one. We study this problem in terms of a competitive analysis measured as a function of $\Delta $, the ply of the system of regions, that is, the maximum number of regions that cover any single point.</ab>
    <rv></rv>
  </abgroup>
</item>