A unified framework for light spanners
From MaRDI portal
Cites work
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- A lower bound for computing geometric spanners
- A PTAS for subset TSP in minor-free graphs
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- An Optimal Synchronizer for the Hypercube
- Approximate Distance Queries in Disk Graphs
- Automata, Languages and Programming
- Colorings of the \(d\)-regular infinite tree
- CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
- Constructing Light Spanners Deterministically in Near-Linear Time
- Contraction decomposition in \(h\)-minor-free graphs and algorithmic applications
- Efficient algorithms for constructing very sparse spanners and emulators
- Euclidean spanners in high dimensions
- Fast constructions of lightweight spanners for general graphs
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- Geometric Spanner Networks
- Graph spanners
- Greedy spanners are optimal in doubling metrics
- scientific article; zbMATH DE number 1670876 (Why is no real title available?)
- scientific article; zbMATH DE number 1670877 (Why is no real title available?)
- scientific article; zbMATH DE number 426329 (Why is no real title available?)
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- scientific article; zbMATH DE number 4155926 (Why is no real title available?)
- scientific article; zbMATH DE number 5764857 (Why is no real title available?)
- scientific article; zbMATH DE number 1263225 (Why is no real title available?)
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- scientific article; zbMATH DE number 2119747 (Why is no real title available?)
- scientific article; zbMATH DE number 910877 (Why is no real title available?)
- Light Euclidean Spanners with Steiner Points
- Light spanners
- Light spanners for high dimensional norms via stochastic decompositions
- Local routing in a tree metric 1-spanner
- Lower bounds for computing geometric spanners and approximate shortest paths
- Near-optimal light spanners
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS
- On hierarchical routing in doubling metrics
- On sparse spanners of weighted graphs
- Online Euclidean Spanners
- Optimal Euclidean Spanners
- Spanners for geometric intersection graphs with applications
- The greedy spanner is existentially optimal (extended abstract)
- The regularity method for graphs with few 4‐cycles
- There are planar graphs almost as good as the complete graph
- Truly Optimal Euclidean Spanners
Cited in
(7)- Light, reliable spanners
- Lightweight near-additive spanners
- An alternate proof of near-optimal light spanners
- Online Euclidean spanners
- On sparse covers of minor free graphs, low dimensional metric embeddings, and other applications
- Lipschitz decompositions of finite _p metrics
- Light edge fault tolerant graph spanners
This page was built for publication: A unified framework for light spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499231)
