Finding Sparser Directed Spanners

A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E) if for every pair of vertices u, v V , the shortest path distance distH (u, v) from u to v in H is at most k

• Type: Journal
• Year: 2010
• Where: FSTTCS
• Authors: Piotr Berman, Sofya Raskhodnikova, Ge Ruan
• Keywords: Approximation Algorithms, Directed Graphs, FSTTCS 2010, Original Graph, Software Engineering