Papers
Topics
Authors
Recent
Search
2000 character limit reached

$\mathcal{O}(k)$-robust spanners in one dimension

Published 23 Mar 2018 in cs.CG | (1803.08719v1)

Abstract: 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 $\mathcal{O}(k)$-robust if deleting $k$ vertices only harms $\mathcal{O}(k)$ other vertices. We show that on any one-dimensional set of $n$ points, for any $\varepsilon>0$, there exists an $\mathcal{O}(k)$-robust $1$-spanner with $\mathcal{O}(n{1+\varepsilon})$ edges. Previously it was only known that $\mathcal{O}(k)$-robust spanners with $\mathcal{O}(n2)$ edges exists and that there are point sets on which any $\mathcal{O}(k)$-robust spanner has $\Omega(n\log{n})$ edges.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.