Reachability Preservers: New Extremal Bounds and Approximation Algorithms
From MaRDI portal
Publication:4608011
zbMath1403.68141arXiv1710.11250MaRDI QIDQ4608011
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1710.11250
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Approximation algorithms (68W25)
Related Items (7)
Near isometric terminal embeddings for doubling metrics ⋮ ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network ⋮ Unnamed Item ⋮ Graph spanners: a tutorial review ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ A note on distance-preserving graph sparsification ⋮ Near Isometric Terminal Embeddings for Doubling Metrics
This page was built for publication: Reachability Preservers: New Extremal Bounds and Approximation Algorithms
