BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
From MaRDI portal
Recommendations
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- Facility location with dynamic distance functions
- Kinetic maintenance of mobile \(k\)-centres on trees
- Kinetic Maintenance of Mobile k-Centres on Trees
- Kinetic 2-centers in the black-box model
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A faster algorithm for the two-center decision problem
- A near-linear algorithm for the planar 2-center problem
- A new heuristic approach for the P-median problem
- An Expander-Based Approach to Geometric Optimization
- Data Structures for Mobile Data
- Discrete mobile centers
- Dynamic Three-Dimensional Linear Programming
- Lower bounds for covering problems
- Maintaining the extent of a moving point set
- More planar two-center algorithms
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
- Smooth kinetic maintenance of clusters
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
Cited in
(9)- Median trajectories
- Covering moving points with anchored disks
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- Kinetic Maintenance of Mobile k-Centres on Trees
- Capturing the shape of a point set with a line segment
- Kinetic maintenance of mobile \(k\)-centres on trees
- Stability analysis of kinetic orientation-based shape descriptors
- The projection median of a set of points
- Topological stability of kinetic \(k\)-centers
This page was built for publication: BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520427)