English
Related papers

Related papers: Light Euclidean Steiner Spanners in the Plane

200 papers

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits…

Computational Geometry · Computer Science 2022-06-22 Sujoy Bhore , Csaba D. Toth

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits…

Computational Geometry · Computer Science 2021-03-16 Sujoy Bhore , Csaba D. Tóth

The FOCS'19 paper of Le and Solomon, culminating a long line of research on Euclidean spanners, proves that the lightness (normalized weight) of the greedy $(1+\epsilon)$-spanner in $\mathbb{R}^d$ is $\tilde{O}(\epsilon^{-d})$ for any $d =…

Computational Geometry · Computer Science 2020-10-16 Hung Le , Shay Solomon

Given a set $S$ of $n$ points in the plane and a parameter $\varepsilon>0$, a Euclidean $(1+\varepsilon)$-spanner is a geometric graph $G=(S,E)$ that contains, for all $p,q\in S$, a $pq$-path of weight at most $(1+\varepsilon)\|pq\|$. We…

Computational Geometry · Computer Science 2023-12-27 Csaba D. Tóth

Euclidean spanners are important geometric structures, having found numerous applications over the years. Cornerstone results in this area from the late 80s and early 90s state that for any $d$-dimensional $n$-point Euclidean space, there…

Computational Geometry · Computer Science 2021-04-06 Hung Le , Shay Solomon

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…

Data Structures and Algorithms · Computer Science 2018-04-23 Arnold Filtser , Ofer Neiman

A Euclidean noncrossing Steiner $(1+\epsilon)$-spanner for a point set $P\subset\mathbb{R}^2$ is a planar straight-line graph that, for any two points $a, b \in P$, contains a path whose length is at most $1+\epsilon$ times the Euclidean…

Computational Geometry · Computer Science 2026-02-23 Sujoy Bhore , Sándor Kisfaludi-Bak , Lazar Milenković , Csaba D. Tóth , Karol Węgrzycki , Sampson Wong

It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…

Computational Geometry · Computer Science 2026-03-30 An La , Hung Le , Shay Solomon , Cuong Than , Vinayak , Shuang Yang , Tianyi Zhang

We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\log n)$ and weight $\omega(T) = O(\log n) \cdot \omega(MST(M))$. Moreover, there is a designated point $rt$ such that for every…

Computational Geometry · Computer Science 2011-08-31 Yefim Dinitz , Michael Elkin , Shay Solomon

Euclidean spanners are important geometric objects that have been extensively studied since the 1980s. The two most basic "compactness'' measures of a Euclidean spanner $E$ are the size (number of edges) $|E|$ and the weight (sum of edge…

Computational Geometry · Computer Science 2024-09-18 Hung Le , Shay Solomon , Cuong Than , Csaba D. Tóth , Tianyi Zhang

An $(\alpha,\beta)$-spanner of a weighted graph $G=(V,E)$, is a subgraph $H$ such that for every $u,v\in V$, $d_G(u,v) \le d_H(u,v)\le\alpha\cdot d_G(u,v)+\beta$. The main parameters of interest for spanners are their size (number of edges)…

Data Structures and Algorithms · Computer Science 2024-11-01 Yuval Gitlitz , Ofer Neiman , Richard Spence

It has long been known that $d$-dimensional Euclidean point sets admit $(1+\epsilon)$-stretch spanners with lightness $W_E = \epsilon^{-O(d)}$, that is total edge weight at most $W_E$ times the weight of the minimum spaning tree of the set…

Computational Geometry · Computer Science 2015-05-15 Lee-Ad Gottlieb

In a seminal STOC'95 paper, titled "Euclidean spanners: short, thin and lanky", Arya et al. devised a construction of Euclidean $(1+\eps)$-spanners that achieves constant degree, diameter $O(\log n)$, and weight $O(\log^2 n) \cdot…

Data Structures and Algorithms · Computer Science 2012-11-28 Michael Elkin , Shay Solomon

We consider Steiner spanners in Euclidean and non-Euclidean geometries. In the Euclidean setting, a recent line of work initiated by Le and Solomon [FOCS'19] and further improved by Chang et al. [SoCG'24] obtained Steiner…

Computational Geometry · Computer Science 2025-09-03 Sándor Kisfaludi-Bak , Geert van Wordragen

Lightness, sparsity, and hop-diameter are the fundamental parameters of geometric spanners. Arya et al. [STOC'95] showed in their seminal work that there exists a construction of Euclidean $(1+\varepsilon)$-spanners with hop-diameter…

Data Structures and Algorithms · Computer Science 2025-05-08 Sujoy Bhore , Lazar Milenkovic

Seminal works on light spanners over the years provide spanners with optimal lightness in various graph classes, such as in general graphs, Euclidean spanners, and minor-free graphs. Three shortcomings of previous works on light spanners…

Computational Geometry · Computer Science 2025-12-05 Hung Le , Shay Solomon

This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean $d$-space: It is shown that for any finite point set $\mathbb{R}^d$, any root, and any $\epsilon>0$, there is a Euclidean Steiner…

Computational Geometry · Computer Science 2026-05-27 Devin Frost , Kimberly Kokado , Csaba D. Tóth

Seminal works on light spanners over the years provide spanners with optimal lightness in various graph classes, such as in general graphs, Euclidean spanners, and minor-free graphs. Three shortcomings of previous works on light spanners…

Data Structures and Algorithms · Computer Science 2021-11-30 Hung Le , Shay Solomon

A classic result in the study of spanners is the existence of light low-stretch spanners for Euclidean spaces. These spanners ahve arbitrary low stretch, and weight only a constant factor greater than that of the minimum spanning tree of…

Computational Geometry · Computer Science 2014-01-21 Lee-Ad Gottlieb , Shay Solomon

An \emph{additive +$\beta W$ spanner} of an edge weighted graph $G=(V,E)$ is a subgraph $H$ of $G$ such that for every pair of vertices $u$ and $v$, $d_{H}(u,v) \le d_G(u,v) + \beta W$, where $d_G(u,v)$ is the shortest path length from $u$…

Data Structures and Algorithms · Computer Science 2025-02-18 Reyan Ahmed , Debajyoti Mondal , Rahnuma Islam Nishat
‹ Prev 1 2 3 10 Next ›