A unified framework for light spanners

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A lower bound for computing geometric spanners
Colorings of the \(d\)-regular infinite tree
On sparse spanners of weighted graphs
There are planar graphs almost as good as the complete graph
Local routing in a tree metric 1-spanner
Spanners for geometric intersection graphs with applications
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Optimal Euclidean Spanners
Geometric Spanner Networks
Graph spanners
A Fast Algorithm for Constructing Sparse Euclidean Spanners
Near-Optimal Light Spanners
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
NEW SPARSENESS RESULTS ON GRAPH SPANNERS
An Optimal Synchronizer for the Hypercube
CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
Fast Constructions of Lightweight Spanners for General Graphs
On Hierarchical Routing in Doubling Metrics
Truly Optimal Euclidean Spanners
Constructing Light Spanners Deterministically in Near-Linear Time
A PTAS for subset TSP in minor-free graphs
Light Spanners
Greedy spanners are optimal in doubling metrics
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
The Greedy Spanner is Existentially Optimal
Contraction decomposition in h-minor-free graphs and algorithmic applications
Approximate Distance Queries in Disk Graphs
Automata, Languages and Programming
Euclidean Spanners in High Dimensions
The regularity method for graphs with few 4‐cycles
Light Euclidean Spanners with Steiner Points
Lower bounds for computing geometric spanners and approximate shortest paths
Online Euclidean Spanners

This page was built for publication: A unified framework for light spanners