Minimum weight Euclidean \((1+\varepsilon)\)-spanners
From MaRDI portal
Publication:6039440
DOI10.1007/978-3-031-15914-5_32arXiv2206.14911OpenAlexW4312991750MaRDI QIDQ6039440
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.14911
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \( \delta \)-greedy \(t\)-spanner
- Low-light trees, and tight lower bounds for Euclidean spanners
- On sparse spanners of weighted graphs
- Approximation of real numbers by rationals: some metric theorems
- The discrepancy of Farey series
- Discrepancy of Farey sequences
- A spanner for the day after
- Deformable spanners and applications
- Balancing Degree, Diameter, and Weight in Euclidean Spanners
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- Optimal Euclidean Spanners
- The shortest path and the shortest road through n points
- On Locality-Sensitive Orderings and Their Applications
- Geometric Spanner Networks
- Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- The Travelling Salesman Problem and Minimum Matching in the Unit Square
- The Greedy Spanner Is Existentially Optimal
- Euclidean Steiner Spanners: Light and Sparse
- Truly Optimal Euclidean Spanners
- Greedy spanners are optimal in doubling metrics
- Light Euclidean Spanners with Steiner Points
- Fully dynamic geometric spanners
- Improved algorithms for constructing fault-tolerant spanners
