Amortized efficiency of list update and paging rules
Communications of the ACM
Range searching and point location among fat objects
Journal of Algorithms
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Randomized algorithms for metrical task systems
Theoretical Computer Science
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 computational framework for incremental motion
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Tracking Targets with Quality inWireless Sensor Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Conflict-free colorings of shallow discs
Proceedings of the twenty-second annual symposium on Computational geometry
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Multi-dimensional online tracking
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Maintaining Nets and Net Trees under Incremental Motion
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Energy-quality tradeoffs for target tracking in wireless sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Quality of Trilateration: Confidence-Based Iterative Localization
IEEE Transactions on Parallel and Distributed Systems
Selecting tracking principals with epoch awareness
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Competitive query strategies for minimising the ply of the potential locations of moving points
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
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 Δ, the ply of the system of regions, that is, the maximum number of regions that cover any single point.