On Pairwise Spanners
From MaRDI portal
Publication:2957885
DOI10.4230/LIPIcs.STACS.2013.209zbMath1354.05131arXiv1301.1999OpenAlexW2115730486MaRDI QIDQ2957885
Telikepalli Kavitha, Marek Cygan, Fabrizio Grandoni
Publication date: 30 January 2017
Full work available at URL: https://arxiv.org/abs/1301.1999
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
Source-wise round-trip spanners ⋮ Small Stretch Pairwise Spanners and Approximate $D$-Preservers ⋮ Improved Purely Additive Fault-Tolerant Spanners ⋮ A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ Near isometric terminal embeddings for doubling metrics ⋮ On additive spanners in weighted graphs with local error ⋮ Vertex fault tolerant additive spanners ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ New pairwise spanners ⋮ Fault tolerant approximate BFS structures with additive stretch ⋮ Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners ⋮ Distributed construction of purely additive spanners ⋮ Graph spanners: a tutorial review ⋮ A fast algorithm for source-wise round-trip spanners ⋮ Fault-tolerant approximate shortest-path trees ⋮ A note on distance-preserving graph sparsification ⋮ Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems ⋮ Near Isometric Terminal Embeddings for Doubling Metrics ⋮ New Results on Linear Size Distance Preservers
This page was built for publication: On Pairwise Spanners
