Topological stability of kinetic \(k\)-centers

DOI10.1016/j.tcs.2021.03.026zbMath1477.68497arXiv1810.00794OpenAlexW3151767248MaRDI QIDQ2662690

Jules Wulms, Ivor van der Hoog, Wouter Meulemans, Kevin Verbeek, Marc J. van Kreveld

Publication date: 14 April 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.00794

zbMATH Keywords

stability analysismobile facility locationtime-varying data

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Continuous location (90B85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• On piercing sets of axis-parallel rectangles and rings
• Kinetic facility location
• Approximation algorithm for the kinetic robust \(k\)-center problem
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• Discrete mobile centers
• More planar two-center algorithms
• A framework for algorithm stability and its application to kinetic Euclidean MSTs
• Deformable spanners and applications
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• Data Structures for Mobile Data
• On the rectangularp-center problem
• Kinetic 2-centers in the black-box model
• THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION

This page was built for publication: Topological stability of kinetic \(k\)-centers