O(k)-robust spanners in one dimension

03/23/2018
by   Kevin Buchin, et al.
0

A geometric t-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most t times the Euclidean distance between the points. Informally, a spanner is O(k)-robust if deleting k vertices only harms O(k) other vertices. We show that on any one-dimensional set of n points, for any ε>0, there exists an O(k)-robust 1-spanner with O(n^1+ε) edges. Previously it was only known that O(k)-robust spanners with O(n^2) edges exists and that there are point sets on which any O(k)-robust spanner has Ω(nn) edges.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/24/2018

Near-Optimal O(k)-Robust Geometric Spanners

For any constants d> 1, ϵ >0, t>1, and any n-point set P⊂R^d, we show th...
research
06/20/2017

The well-separated pair decomposition for balls

Given a real number t>1, a geometric t-spanner is a geometric graph for ...
research
12/03/2018

On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic

Given a set of n points in R^d, the (monochromatic) Closest Pair proble...
research
11/16/2018

A Spanner for the Day After

We show how to construct (1+ε)-spanner over a set P of n points in R^d t...
research
09/04/2017

Fault-Tolerant Additive Weighted Geometric Spanners

Let S be a set of n points and let w be a function that assigns non-nega...
research
04/27/2021

Communication Costs in a Geometric Communication Network

A communication network is a graph in which each node has only local inf...
research
07/16/2018

Note on minimal number of skewed unit cells for periodic distance calculation

How many copies of a parallelepiped are needed to ensure that for every ...

Please sign up or login with your details

Forgot password? Click here to reset