Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Almost Shortest Paths with Near-Additive Error in Weighted Graphs

Published 26 Jul 2019 in cs.DS | (1907.11422v3)

Abstract: Let G=(V,E,w)G=(V,E,w) be a weighted undirected graph with nn vertices and mm edges, and fix a set of ss sources S⊆VS\subseteq V. We study the problem of computing {\em almost shortest paths} (ASP) for all pairs in S×VS \times V in both classical centralized and parallel (PRAM) models of computation. Consider the regime of multiplicative approximation of 1+ϵ1+\epsilon, for an arbitrarily small constant ϵ>0\epsilon > 0 . In this regime existing centralized algorithms require Ω(min⁡{∣E∣s,nω})\Omega(\min\{|E|s,n^\omega\}) time, where ω<2.372\omega < 2.372 is the matrix multiplication exponent. Existing PRAM algorithms with polylogarithmic depth (aka time) require work Ω(min⁡{∣E∣s,nω})\Omega(\min\{|E|s,n^\omega\}). Our centralized algorithm has running time O((m+ns)nρ)O((m+ ns)n^\rho), and its PRAM counterpart has polylogarithmic depth and work O((m+ns)nρ)O((m + ns)n^\rho), for an arbitrarily small constant ρ>0\rho > 0. For a pair (s,v)∈S×V(s,v) \in S\times V, it provides a path of length d^(s,v)\hat{d}(s,v) that satisfies d^(s,v)≤(1+ϵ)dG(s,v)+β⋅W(s,v)\hat{d}(s,v) \le (1+\epsilon)d_G(s,v) + \beta \cdot W(s,v), where W(s,v)W(s,v) is the weight of the heaviest edge on some shortest s−vs-v path. Hence our additive term depends linearly on a {\em local} maximum edge weight, as opposed to the global maximum edge weight in previous works. Finally, our β=(1/ρ)O(1/ρ)\beta = (1/\rho)^{O(1/\rho)}. We also extend a centralized algorithm of Dor et al. \cite{DHZ00}. For a parameter κ=1,2,…\kappa = 1,2,\ldots, this algorithm provides for {\em unweighted} graphs a purely additive approximation of 2(κ−1)2(\kappa -1) for {\em all pairs shortest paths} (APASP) in time O~(n2+1/κ)\tilde{O}(n^{2+1/\kappa}). Within the same running time, our algorithm for {\em weighted} graphs provides a purely additive error of 2(κ−1)W(u,v)2(\kappa - 1) W(u,v), for every vertex pair (u,v)∈(V2)(u,v) \in {V \choose 2}, with W(u,v)W(u,v) defined as above. On the way to these results we devise a suit of novel constructions of spanners, emulators and hopsets.

Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.