{O}(k)-robust spanners in one dimension
Kevin Buchin, Tim Hulshof, Dániel Oláh
Abstract
Kevin Buchin, Tim Hulshof, Dániel Oláh
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 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(n1+ε) edges. Previously it was only known that O(k)-robust spanners with O(n2) edges exists and that there are point sets on which any O(k)-robust spanner has Ω(nlogn) edges.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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(n1+ε) edges. Previously it was only known that O(k)-robust spanners with O(n2) edges exists and that there are point sets on which any O(k)-robust spanner has Ω(nlogn) edges.
Key concepts: Spanner, Combinatorics, Mathematics, Euclidean distance, Euclidean space, Dimension (graph theory), Euclidean geometry, Graph