Recommendations
Cited in
(23)- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- Spanning spiders and light-splitting switches
- Constructing light spanners deterministically in near-linear time
- On additive spanners in weighted graphs with local error
- Light spanners in bounded pathwidth graphs
- Near-optimal light spanners
- The greedy spanner is existentially optimal
- Fast constructions of lightweight spanners for general graphs
- Light spanners for high dimensional norms via stochastic decompositions
- Truly Optimal Euclidean Spanners
- Constructing Light Spanners Deterministically in Near-Linear Time
- The norms of graph spanners
- Light spanners
- Bypassing Erdős' girth conjecture: hybrid stretch and sourcewise spanners
- The greedy spanner is existentially optimal (extended abstract)
- Algorithms – ESA 2004
- Light spanners
- Fast constructions of light-weight spanners for general graphs
- Light Euclidean Spanners with Steiner Points
- A unified framework for light spanners
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- Truly optimal Euclidean spanners
- Lightweight near-additive spanners
This page was built for publication: Near-optimal light spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575642)
