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

DOI10.1137/1.9781611975994.30MaRDI QIDQ5146796zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• New bounds for approximating extremal distances in undirected graphs
• Distance Approximation in Bounded-Degree and General Sparse Graphs
• scientific article; zbMATH DE number 2170483
• On tight spans for directed distances
• scientific article; zbMATH DE number 1875406
• Approximating the norms of graph spanners
• Tight conditional lower bounds for approximating diameter in directed graphs
• Extremal problems for directed graphs
• Extremal problems on distance spectra of graphs
• Optimal approximation algorithms for maximum distance-bounded subgraph problems

Cited in

(6)

• Graph spanners: a tutorial review
• On the L  ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
• scientific article; zbMATH DE number 6784973 (Why is no real title available?)
• Distributed distance approximation
• Fault-tolerant ST-diameter oracles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146796)