Computing almost shortest paths
From MaRDI portal
Publication:5890493
DOI10.1145/383962.383983zbMath1333.05287OpenAlexW2002296715MaRDI QIDQ5890493
Publication date: 4 March 2016
Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/383962.383983
Analysis of algorithms (68W40) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (11)
Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ A faster distributed protocol for constructing a minimum spanning tree ⋮ Improved weighted additive spanners ⋮ Approximating average parameters of graphs ⋮ Sublinear fully distributed partition with applications ⋮ A parallel bio-inspired shortest path algorithm ⋮ Improved Approximation for the Directed Spanner Problem ⋮ Combinatorial algorithms for distributed graph coloring ⋮ Transitive-Closure Spanners: A Survey ⋮ Graph Embedding through Random Walk for Shortest Paths Problems ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
This page was built for publication: Computing almost shortest paths
