Topological Stability of Kinetic k-Centers

10/01/2018
by   Ivor van der Hoog, et al.
0

We study the k-center problem in a kinetic setting: given a set of continuously moving points P in the plane, determine a set of k (moving) disks that cover P at every time step, such that the disks are as small as possible at any point in time. Whereas the optimal solution over time may exhibit discontinuous changes, many practical applications require the solution to be stable: the disks must move smoothly over time. Existing results on this problem require the disks to move with a bounded speed, but this model is very hard to work with. Hence, the results are limited and offer little theoretical insight. Instead, we study the topological stability of k-centers. Topological stability was recently introduced and simply requires the solution to change continuously, but may do so arbitrarily fast. We prove upper and lower bounds on the ratio between the radii of an optimal but unstable solution and the radii of a topologically stable solution---the topological stability ratio---considering various metrics and various optimization criteria. For k = 2 we provide tight bounds, and for small k > 2 we can obtain nontrivial lower and upper bounds. Finally, we provide an algorithm to compute the topological stability ratio in polynomial time for constant k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2022

Towards Optimal Lower Bounds for k-median and k-means Coresets

Given a set of points in a metric space, the (k,z)-clustering problem co...
research
01/13/2020

Lower Bounds for Shoreline Searching with 2 or More Robots

Searching for a line on the plane with n unit speed robots is a classic ...
research
10/06/2020

On Euclidean Steiner (1+ε)-Spanners

Lightness and sparsity are two natural parameters for Euclidean (1+ε)-sp...
research
12/27/2021

Weighted and shifted BDF3 methods on variable grids for a parabolic problem

As is well known, the stability of the 3-step backward differentiation f...
research
07/01/2020

A survey on stability measure of networks

In this paper, we discuss tenacity and its properties in the stability c...
research
12/10/2021

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem

Let P be a set of points in ℝ^d, where each point p∈ P has an associated...
research
03/23/2021

Mono-monostatic polyhedra with uniform point masses have at least 8 vertices

The monostatic property of convex polyhedra (i.e. the property of having...

Please sign up or login with your details

Forgot password? Click here to reset