Additionally, we provide near-optimal approxima- tion algorithms for computing the vertex eccentricities of a graph in both static and dynamic settings.

Dec 23, 2019 · We show the existence of (and algorithms to compute) various t-diameter spanners with a sparse set of edges and t < 2, for directed graphs.

Jan 28, 2020 · We show the existence of (and algorithms to compute) various t-diameter spanners with a sparse set of edges and t < 2, for directed graphs. In ...

This work shows the existence of (and algorithms to compute) various t -diameter spanners with a sparse set of edges and t ă 2, for directed graphs, ...

We propose a polylogarithmic approximation algorithm in directed graphs, while in undirected graphs we give a and a -approximation algorithm for arbitrary ...

Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms by Keerti Choudhary, Omer Gold.

Keerti Choudhary , Omer Gold: Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms. SODA 2020: 495-514.

New bounds are provided for the approximation of extremal distances (the diameter, the radius, and the eccentricities of all nodes) of an undirected graph ...

We provide new bounds for the approximation of extremal distances (the diameter, the radius, and the eccentricities of all nodes) of an undirected graph ...

Extremal Distances in Directed graphs: Tight Spanners and Near-Optimal Approximation Algorithms with Omer Gold SODA 2020 – Symposium on Discrete Algorithms ...