Kinetic maintenance of mobile \(k\)-centres on trees
From MaRDI portal
Publication:1028114
DOI10.1016/j.dam.2008.10.006zbMath1172.05019MaRDI QIDQ1028114
Stephane Durocher, Christophe Paul
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.006
Cites Work
- Finding the upper envelope of n line segments in O(n log n) time
- The upper envelope of piecewise linear functions: Algorithms and applications
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Algorithms for the m-center problems: A survey
- Discrete mobile centers
- Deformable spanners and applications
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Data Structures for Mobile Data
- The absolute center of a network
- Smooth kinetic maintenance of clusters
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- Lowest common ancestors in trees and directed acyclic graphs
- Maintaining the extent of a moving point set
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item