Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 23 Mar 2018 in cs.CG

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

We haven't generated a summary for this paper yet.