Light Euclidean Spanners with Steiner Points
From MaRDI portal
Publication:5874539
Recommendations
- Euclidean Steiner spanners: light and sparse
- Euclidean Steiner shallow-light trees
- Euclidean Steiner shallow-light trees
- On spanners and lightweight spanners of geometric graphs
- Approximate Euclidean Steiner trees
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- Optimal Euclidean Spanners
- Light spanners in bounded pathwidth graphs
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
Cites work
- scientific article; zbMATH DE number 4070353 (Why is no real title available?)
- scientific article; zbMATH DE number 1979513 (Why is no real title available?)
- scientific article; zbMATH DE number 1532274 (Why is no real title available?)
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- scientific article; zbMATH DE number 2119744 (Why is no real title available?)
- scientific article; zbMATH DE number 910877 (Why is no real title available?)
- scientific article; zbMATH DE number 7378699 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- A PTAS for subset TSP in minor-free graphs
- A subset spanner for Planar graphs, with application to subset TSP
- A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
- Algorithms and Computation
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- Algorithms – ESA 2005
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
- Approximate distance oracles for geometric spanners
- Better distance preservers and additive spanners
- Classes of graphs which approximate the complete Euclidean graph
- Clustering motion
- Constructing Light Spanners Deterministically in Near-Linear Time
- Constructing sparse spanners for most graphs in higher dimensions
- Deformable spanners and applications
- Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
- Effectiveness of local search for geometric optimization
- Efficient construction of a bounded-degree spanner with low weight
- Euclidean Steiner shallow-light trees
- Experimental Study of Geometric t-Spanners: A Running Time Comparison
- Faster algorithms for the geometric transportation problem
- Geometric Spanner Networks
- Geometric approximation algorithms
- Greedy spanners are optimal in doubling metrics
- How fast is the \(k\)-means method?
- Light spanners
- Low-distortion embeddings of general metrics into the line
- Narrow-Shallow-Low-Light Trees with and without Steiner Points
- Near-optimal light spanners
- Near-optimal light spanners
- Net and prune: a linear time algorithm for Euclidean distance problems
- New Doubling Spanners: Better and Simpler
- New constructions of SSPDs and their applications
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
- On hierarchical routing in doubling metrics
- On sparse spanners of weighted graphs
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- STACS 2005
- Sparse communication networks and efficient routing in the plane (extended abstract)
- Steiner shallow-light trees are exponentially lighter than spanning ones
- The minimum Manhattan network problem: Approximations and exact solutions
- There are planar graphs almost as good as the complete graph
- Viewing the rings of a tree: minimum distortion embeddings into trees
- Well-separated pair decomposition in linear time?
- \(\delta\)-greedy \(t\)-spanner
Cited in
(5)
This page was built for publication: Light Euclidean Spanners with Steiner Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874539)
