Kinetic 2-centers in the black-box model

DOI10.1145/2462356.2462393MaRDI QIDQ5174472zbMATH OpenOpenAlexFDO

Authors Marcel Roeloffzen, Bettina Speckmann, Mark de Berg

Publication date 17 February 2015

Published in Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2462356.2462393

zbMATH Keywords

2-center problemblack-box modelkinetic data structuresmobile facility location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Approximation algorithm for the kinetic robust \(k\)-center problem
• scientific article; zbMATH DE number 1728311
• Kinetic maintenance of mobile \(k\)-centres on trees
• Topological stability of kinetic \(k\)-centers
• Kinetic Maintenance of Mobile k-Centres on Trees

Cited in

(18)

• Topological stability of kinetic \(k\)-centers
• scientific article; zbMATH DE number 1728311 (Why is no real title available?)
• Computing the center of uncertain points on tree networks
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• The maximum box problem for moving points in the plane
• Computing the rectilinear center of uncertain points in the plane
• Topological stability of kinetic \(k\)-centers
• Computing the center of uncertain points on tree networks
• Two-center of the convex hull of a point set: dynamic model, and restricted streaming model
• Kinetic Maintenance of Mobile k-Centres on Trees
• Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
• A frequency-competitive query strategy for maintaining low collision potential among moving entities
• Stability analysis of kinetic orientation-based shape descriptors
• Optimal algorithm for the planar two-center problem
• Optimal algorithm for the planar two-center problem
• Frequency-competitive query strategies to maintain low congestion potential among moving entities
• Capturing the shape of a point set with a line segment
• Approximation algorithm for the kinetic robust \(k\)-center problem

This page was built for publication: Kinetic 2-centers in the black-box model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174472)