Affiliation:
1. University of Michigan EECS, Ann Arbor, MI, USA
2. MIT EECS, Cambridge, MA, USA
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference31 articles.
1. The 4/3 additive spanner exponent is tight;Abboud Amir;Journal of the ACM (JACM),2017
2. Fast estimation of diameter and shortest paths (without matrix multiplication);Aingworth Donald;SIAM J. Comput.,1999
3. On sparse spanners of weighted graphs;Althöfer Ingo;Discrete & Computational Geometry,1993
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Reachability Preservers: New Extremal Bounds and Approximation Algorithms;SIAM Journal on Computing;2024-03-13
2. Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n);2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Bridge Girth: A Unifying Notion in Network Design;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06