Minimum weight Euclidean (1+)-spanners
From MaRDI portal
Publication:6201907
DOI10.1016/J.EJC.2024.103927MaRDI QIDQ6201907FDOQ6201907
Authors: Csaba D. Tóth 
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
Cites Work
- Geometric Spanner Networks
- Title not available (Why is that?)
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On sparse spanners of weighted graphs
- Title not available (Why is that?)
- Deformable spanners and applications
- Geometric approximation algorithms
- Classes of graphs which approximate the complete Euclidean graph
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- Title not available (Why is that?)
- Theta-3 is connected
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- Title not available (Why is that?)
- The shortest path and the shortest road through n points
- On locality-sensitive orderings and their applications
- The Travelling Salesman Problem and Minimum Matching in the Unit Square
- Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- Efficient construction of a bounded-degree spanner with low weight
- New and improved spanning ratios for Yao graphs
- Lattice spanners of low degree
- Improved algorithms for constructing fault-tolerant spanners
- \( \delta \)-greedy \(t\)-spanner
- Greedy spanners are optimal in doubling metrics
- Improved bounds on the spanning ratio of the theta-5-graph
- Towards tight bounds on theta-graphs: more is not always better
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- Lower bound for sparse Euclidean spanners
- Low-light trees, and tight lower bounds for Euclidean spanners
- Discrepancy of Farey sequences
- Approximation of real numbers by rationals: some metric theorems
- The discrepancy of Farey series
- Optimal Euclidean Spanners
- The greedy spanner is existentially optimal
- Truly Optimal Euclidean Spanners
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph
- A spanner for the day after
- Fully dynamic geometric spanners
- Euclidean Steiner spanners: light and sparse
- Light Euclidean Spanners with Steiner Points
- A note on optimal degree-three spanners of the square lattice
This page was built for publication: Minimum weight Euclidean \((1+\varepsilon)\)-spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201907)
