Kinetic Maintenance of Mobile k-Centres on Trees
From MaRDI portal
Publication:5387769
DOI10.1007/978-3-540-77120-3_31zbMath1193.68083OpenAlexW1509408808MaRDI QIDQ5387769
Christophe Paul, Stephane Durocher
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_31
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Algorithms for the m-center problems: A survey
- Discrete mobile centers
- Smooth kinetic maintenance of clusters
- 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
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Data Structures for Mobile Data
- The absolute center of a network
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- Maintaining the extent of a moving point set
This page was built for publication: Kinetic Maintenance of Mobile k-Centres on Trees
