EUVIMEDEUVIMED entdecken
Crossref

Better Distance Preservers and Additive Spanners

Greg Bodwin, Virginia Vassilevska Williams

ACM Transactions on Algorithms · 31.10.2021 · 17 (4) · 1-24

DOI: 10.1145/3490147 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Algorithms, online erschienen am 05.10.2021. Verfasst von Greg Bodwin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 31 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers , which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work on distance preservers has exploited only a simple structural property of shortest paths, called consistency , stating that one can break shortest path ties such that no two paths intersect, split apart, and then intersect again later. We prove that consistency alone is not enough to understand distance preservers, by showing both a lower bound on the power of consistency and a new general upper bound that polynomially surpasses it. Specifically, our new upper bound is that any p demand pairs in an n -node undirected unweighted graph have a distance preserver on O( n 2/3 p 2/3 + np 1/3 edges. We leave a conjecture that the right bound is O ( n 2/3 p 2/3 + n ) or better. The second part of this paper leverages these distance preservers in a new construction of additive spanners , which are subgraphs that preserve all pairwise distances up to an additive error function. We give improved error bounds for spanners with relatively few edges; for example, we prove that all graphs have spanners on O(n) edges with + O ( n 3/7 + ε ) error. Our construction can be viewed as an extension of the popular path-buying framework to clusters of larger radii.

Zitieren

APA

Bodwin, G., & Williams, V. V. (2021). Better Distance Preservers and Additive Spanners. ACM Transactions on Algorithms, 17(4), 1-24. https://doi.org/10.1145/3490147

Vancouver

Bodwin G, Williams VV. Better Distance Preservers and Additive Spanners. ACM Transactions on Algorithms. 2021;17(4):1-24. doi:10.1145/3490147

BibTeX
@article{Bodwin2021,
  author = {Bodwin, Greg and Williams, Virginia Vassilevska},
  title = {Better Distance Preservers and Additive Spanners},
  journal = {ACM Transactions on Algorithms},
  year = {2021},
  volume = {17},
  number = {4},
  pages = {1--24},
  doi = {10.1145/3490147}
}
Kostenlos starten →