Discrete mobile centers
From MaRDI portal
Publication:1404530
DOI10.1007/S00454-003-2925-6zbMATH Open1038.68131OpenAlexW2048902080MaRDI QIDQ1404530FDOQ1404530
Publication date: 21 August 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-003-2925-6
Cited In (20)
- Minimum enclosing circle of a set of fixed points and a mobile point
- Kinetic facility location
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Covering moving points with anchored disks
- 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
- A clustering-based approach to kinetic closest pair
- Plane hop spanners for unit disk graphs: simpler and better
- Kinetic clustering of points on the line
- Kinetic Maintenance of Mobile k-Centres on Trees
- Cellular bucket brigades
- An update algorithm for restricted random walk clustering for dynamic data sets
- Robot navigation in a decentralized landmark-free sensor network
- Trajectory clustering of points in \(\mathbb{R}\)
- Kinetic maintenance of mobile \(k\)-centres on trees
- Distributed approximation of capacitated dominating sets
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- Constant-time distributed dominating set approximation
- Deformable spanners and applications
- Topological stability of kinetic \(k\)-centers
Recommendations
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)
