Approximating Low-Stretch Spanners

DOI10.1137/1.9781611974331.ch59zbMath1410.68294OpenAlexW4240054244MaRDI QIDQ4575638

Michael Dinitz, Ze Yu Zhang

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch59

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (9)

Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graph spanners: a tutorial review ⋮ On the approximability and hardness of the minimum connected dominating set with routing cost constraint ⋮ Distributed Spanner Approximation ⋮ Unnamed Item ⋮ Lasserre integrality gaps for graph spanners and related problems

This page was built for publication: Approximating Low-Stretch Spanners