A unified framework for light spanners
From MaRDI portal
Publication:6499231
DOI10.1145/3564246.3585185MaRDI QIDQ6499231FDOQ6499231
Authors: Hung Le, Shay Solomon
Publication date: 8 May 2024
Cites Work
- A lower bound for computing geometric spanners
- Title not available (Why is that?)
- Geometric Spanner Networks
- Title not available (Why is that?)
- Lower bounds for computing geometric spanners and approximate shortest paths
- There are planar graphs almost as good as the complete graph
- An Optimal Synchronizer for the Hypercube
- On sparse spanners of weighted graphs
- Graph spanners
- Automata, Languages and Programming
- Title not available (Why is that?)
- Spanners for geometric intersection graphs with applications
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS
- Title not available (Why is that?)
- Contraction decomposition in \(h\)-minor-free graphs and algorithmic applications
- Local routing in a tree metric 1-spanner
- Title not available (Why is that?)
- Colorings of the \(d\)-regular infinite tree
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- Light spanners
- Greedy spanners are optimal in doubling metrics
- Approximate Distance Queries in Disk Graphs
- Efficient algorithms for constructing very sparse spanners and emulators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Near-optimal light spanners
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Euclidean Spanners
- Fast constructions of lightweight spanners for general graphs
- The greedy spanner is existentially optimal (extended abstract)
- Constructing Light Spanners Deterministically in Near-Linear Time
- On hierarchical routing in doubling metrics
- Title not available (Why is that?)
- Truly Optimal Euclidean Spanners
- Euclidean spanners in high dimensions
- Title not available (Why is that?)
- Online Euclidean Spanners
- Light Euclidean Spanners with Steiner Points
- A PTAS for subset TSP in minor-free graphs
- The regularity method for graphs with few 4‐cycles
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)