Matches in SemOpenAlex for { <https://semopenalex.org/work/W4297079376> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W4297079376 abstract "The distributed single-source shortest paths problem is one of the most fundamental and central problems in the message-passing distributed computing. Classical Bellman-Ford algorithm solves it in $O(n)$ time, where $n$ is the number of vertices in the input graph $G$. Peleg and Rubinovich (FOCS'99) showed a lower bound of $tilde{Omega}(D + sqrt{n})$ for this problem, where $D$ is the hop-diameter of $G$. Whether or not this problem can be solved in $o(n)$ time when $D$ is relatively small is a major notorious open question. Despite intensive research cite{LP13,N14,HKN15,EN16,BKKL16} that yielded near-optimal algorithms for the approximate variant of this problem, no progress was reported for the original problem. In this paper we answer this question in the affirmative. We devise an algorithm that requires $O((n log n)^{5/6})$ time, for $D = O(sqrt{n log n})$, and $O(D^{1/3} cdot (n log n)^{2/3})$ time, for larger $D$. This running time is sublinear in $n$ in almost the entire range of parameters, specifically, for $D = o(n/log^2 n)$. For the all-pairs shortest paths problem, our algorithm requires $O(n^{5/3} log^{2/3} n)$ time, regardless of the value of $D$. We also devise the first algorithm with non-trivial complexity guarantees for computing exact shortest paths in the multipass semi-streaming model of computation. From the technical viewpoint, our algorithm computes a hopset $G$ of a skeleton graph $G'$ of $G$ without first computing $G'$ itself. We then conduct a Bellman-Ford exploration in $G' cup G$, while computing the required edges of $G'$ on the fly. As a result, our algorithm computes exactly those edges of $G'$ that it really needs, rather than computing approximately the entire $G'$." @default.
- W4297079376 created "2022-09-26" @default.
- W4297079376 creator A5075683085 @default.
- W4297079376 date "2017-03-06" @default.
- W4297079376 modified "2023-09-23" @default.
- W4297079376 title "Distributed Exact Shortest Paths in Sublinear Time" @default.
- W4297079376 doi "https://doi.org/10.48550/arxiv.1703.01939" @default.
- W4297079376 hasPublicationYear "2017" @default.
- W4297079376 type Work @default.
- W4297079376 citedByCount "0" @default.
- W4297079376 crossrefType "posted-content" @default.
- W4297079376 hasAuthorship W4297079376A5075683085 @default.
- W4297079376 hasBestOaLocation W42970793761 @default.
- W4297079376 hasConcept C11413529 @default.
- W4297079376 hasConcept C114614502 @default.
- W4297079376 hasConcept C117160843 @default.
- W4297079376 hasConcept C118615104 @default.
- W4297079376 hasConcept C121332964 @default.
- W4297079376 hasConcept C130120984 @default.
- W4297079376 hasConcept C132525143 @default.
- W4297079376 hasConcept C134306372 @default.
- W4297079376 hasConcept C199360897 @default.
- W4297079376 hasConcept C2779557605 @default.
- W4297079376 hasConcept C3017489831 @default.
- W4297079376 hasConcept C311688 @default.
- W4297079376 hasConcept C33923547 @default.
- W4297079376 hasConcept C41008148 @default.
- W4297079376 hasConcept C62520636 @default.
- W4297079376 hasConcept C63553672 @default.
- W4297079376 hasConcept C77553402 @default.
- W4297079376 hasConceptScore W4297079376C11413529 @default.
- W4297079376 hasConceptScore W4297079376C114614502 @default.
- W4297079376 hasConceptScore W4297079376C117160843 @default.
- W4297079376 hasConceptScore W4297079376C118615104 @default.
- W4297079376 hasConceptScore W4297079376C121332964 @default.
- W4297079376 hasConceptScore W4297079376C130120984 @default.
- W4297079376 hasConceptScore W4297079376C132525143 @default.
- W4297079376 hasConceptScore W4297079376C134306372 @default.
- W4297079376 hasConceptScore W4297079376C199360897 @default.
- W4297079376 hasConceptScore W4297079376C2779557605 @default.
- W4297079376 hasConceptScore W4297079376C3017489831 @default.
- W4297079376 hasConceptScore W4297079376C311688 @default.
- W4297079376 hasConceptScore W4297079376C33923547 @default.
- W4297079376 hasConceptScore W4297079376C41008148 @default.
- W4297079376 hasConceptScore W4297079376C62520636 @default.
- W4297079376 hasConceptScore W4297079376C63553672 @default.
- W4297079376 hasConceptScore W4297079376C77553402 @default.
- W4297079376 hasLocation W42970793761 @default.
- W4297079376 hasOpenAccess W4297079376 @default.
- W4297079376 hasPrimaryLocation W42970793761 @default.
- W4297079376 hasRelatedWork W2163097371 @default.
- W4297079376 hasRelatedWork W2949683154 @default.
- W4297079376 hasRelatedWork W2949855858 @default.
- W4297079376 hasRelatedWork W2982308531 @default.
- W4297079376 hasRelatedWork W3014095280 @default.
- W4297079376 hasRelatedWork W3020724744 @default.
- W4297079376 hasRelatedWork W3184929353 @default.
- W4297079376 hasRelatedWork W3215914422 @default.
- W4297079376 hasRelatedWork W4313533684 @default.
- W4297079376 hasRelatedWork W4317672243 @default.
- W4297079376 isParatext "false" @default.
- W4297079376 isRetracted "false" @default.
- W4297079376 workType "article" @default.