Discrete mobile centers
From MaRDI portal
Recommendations
Cited in
(23)- Kinetic maintenance of mobile \(k\)-centres on trees
- Smooth kinetic maintenance of clusters
- Plane hop spanners for unit disk graphs: simpler and better
- Deformable spanners and applications
- Topological stability of kinetic \(k\)-centers
- Cellular bucket brigades
- Kinetic clustering of points on the line
- Trajectory clustering of points in \(\mathbb{R}\)
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- Minimum enclosing circle of a set of fixed points and a mobile point
- Covering moving points with anchored disks
- Discrete mobile centers
- Kinetic Maintenance of Mobile k-Centres on Trees
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS
- Constant-time distributed dominating set approximation
- Distributed approximation of capacitated dominating sets
- Robot navigation in a decentralized landmark-free sensor network
- A clustering-based approach to kinetic closest pair
- An update algorithm for restricted random walk clustering for dynamic data sets
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Kinetic facility location
This page was built for publication: Discrete mobile centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404530)