A unified framework for light spanners

Cites work

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?)
scientific article; zbMATH DE number 7378699 (Why is no real title available?)
A Fast Algorithm for Constructing Sparse Euclidean Spanners
A PTAS for subset TSP in minor-free graphs
A lower bound for computing geometric spanners
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
CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
Colorings of the \(d\)-regular infinite tree
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 Greedy Algorithms for Constructing Sparse Geometric Spanners
Fast constructions of lightweight spanners for general graphs
Geometric Spanner Networks
Graph spanners
Greedy spanners are optimal in doubling metrics
Light Euclidean Spanners with Steiner Points
Light spanners
Local routing in a tree metric 1-spanner
Lower bounds for computing geometric spanners and approximate shortest paths
NEW SPARSENESS RESULTS ON GRAPH SPANNERS
Near-optimal light 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

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)