Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms

DOI10.1137/1.9781611975994.30OpenAlexW2998044435MaRDI QIDQ5146796

Keerti Choudhary, Omer Gold

Publication date: 2 February 2021

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Graph spanners: a tutorial review ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities

This page was built for publication: Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms