Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths

A (β, ∈)-hopset for a weighted undirected n-vertex graph G = (V, E) is a set of edges, whose addition to the graph guarantees that every pair of vertices has a path between them that contains at most β edges, whose length is within 1 + ∈ of the shortest path. In her seminal paper, Cohen [8, JACM 2000] introduced the notion of hopsets in the context of parallel computation of approximate shortest paths, and since then it has found numerous applications in various other settings, such as dynamic graph algorithms, distributed computing, and the streaming model. Cohen [8] devised efficient algorithms for constructing hopsets with polylogarithmic in n number of hops. Her constructions remain the state-of-the-art since the publication of her paper in STOC'94, i.e., for more than two decades. In this paper we exhibit the first construction of sparse hopsets with a constant number of hops. We also find efficient algorithms for hopsets in various computational settings, improving the best known constructions. Generally, our hopsets strictly outperform the hopsets of [8], both in terms of their parameters, and in terms of the resources required to construct them. We demonstrate the applicability of our results for the fundamental problem of computing approximate shortest paths from s sources. Our results improve the running time for this problem in the parallel, distributed and streaming models, for a vast range of s.

[1]  Polylog-time and near-linear work approximation scheme for undirected shortest paths , 2000, JACM.

[2]  Edith Cohen,et al.  Using selective path-doubling for parallel shortest-path computations , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[3]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[4]  HenzingerMonika,et al.  Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2018 .

[5]  Danupon Nanongkai,et al.  Distributed approximation algorithms for weighted shortest paths , 2014, STOC.

[6]  David Peleg,et al.  (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..

[7]  Christoph Lenzen,et al.  Approximate Undirected Transshipment and Shortest Paths via Gradient Descent , 2016, ArXiv.

[8]  Lenore Cowen,et al.  Near-linear cost sequential and distributed constructions of sparse neighborhood covers , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[9]  Philip N. Klein,et al.  A linear-processor polylog-time algorithm for shortest paths in planar graphs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[10]  Michael Elkin,et al.  Computing almost shortest paths , 2001, TALG.

[11]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

[12]  Aaron Bernstein,et al.  Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[13]  Anupam Gupta,et al.  Small Hop-diameter Sparse Spanners for Doubling Metrics , 2006, SODA '06.

[14]  Mikkel Thorup,et al.  Spanners and emulators with sublinear distance errors , 2006, SODA '06.

[15]  Michael Elkin,et al.  Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory , 2017, ArXiv.

[16]  Seth Pettie,et al.  A Hierarchy of Lower Bounds for Sublinear Additive Spanners , 2016, SODA.

[17]  Baruch Awerbuch,et al.  Sparse Partitions (Extended Abstract , 1990, FOCS 1990.

[18]  Edith Cohen.  Fast algorithms for constructing t-spanners and paths with stretch t , 1993, FOCS.

[19]  Michael Elkin,et al.  Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models , 2006, Distributed Computing.

[20]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[21]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[22]  Jian Zhang,et al.  Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. , 2004, PODC 2004.

[23]  Philip N. Klein,et al.  A Randomized Parallel Algorithm for Single-Source Shortest Paths , 1997, J. Algorithms.

[24]  Thomas H. Spencer,et al.  Time-Work Tradeoffs of the Single-Source Shortest Paths Problem , 1999, J. Algorithms.

[25]  Gary L. Miller,et al.  Improved Parallel Algorithms for Spanners and Hopsets , 2015, SPAA.

[26]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[27]  Boaz Patt-Shamir,et al.  Fast Partial Distance Estimation and Applications , 2014, PODC.

[28]  Mihalis Yannakakis,et al.  High-probability parallel transitive closure algorithms , 1990, SPAA '90.

[29]  Andrew Chi-Chih Yao,et al.  Space-time tradeoff for answering range queries (Extended Abstract) , 1982, STOC '82.

[30]  Michael Elkin,et al.  On efficient distributed construction of near optimal routing schemes , 2017, Distributed Computing.

[31]  Christoph Lenzen,et al.  Algebraic methods in the congested clique , 2015, Distributed Computing.

[32]  Monika Henzinger,et al.  A deterministic almost-tight distributed algorithm for approximating single-source shortest paths , 2015, STOC.

[33]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[34]  Monika Henzinger,et al.  Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.