Better Distance Preservers and Additive Spanners

<jats:p> We study two popular ways to sketch the shortest path distances of an input graph. The first is <jats:italic>distance preservers</jats:italic> , which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work on dis...

Full description

Bibliographic Details
Main Authors: Bodwin, Greg (Author), Williams, Virginia Vassilevska (Author)
Format: Article
Language:English
Published: Association for Computing Machinery (ACM), 2022-07-21T17:13:17Z.
Subjects:
Online Access:Get fulltext