Kinetic Maintenance of Mobile k-Centres on Trees
From MaRDI portal
(Redirected from Publication:5387769)
Recommendations
Cites work
- scientific article; zbMATH DE number 4003873 (Why is no real title available?)
- scientific article; zbMATH DE number 177557 (Why is no real title available?)
- scientific article; zbMATH DE number 1501063 (Why is no real title available?)
- Algorithms for the m-center problems: A survey
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- Data Structures for Mobile Data
- Deformable spanners and applications
- Discrete mobile centers
- Finding the upper envelope of n line segments in O(n log n) time
- Maintaining approximate extent measures of moving points
- Maintaining the extent of a moving point set
- Smooth kinetic maintenance of clusters
- 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
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- The absolute center of a network
Cited in
(8)- Kinetic facility location
- Discrete mobile centers
- Kinetic maintenance of mobile \(k\)-centres on trees
- The Kinetic Facility Location Problem
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- Kinetic 2-centers in the black-box model
- Topological stability of kinetic \(k\)-centers
- Topological stability of kinetic \(k\)-centers
This page was built for publication: Kinetic Maintenance of Mobile k-Centres on Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387769)