Computing almost shortest paths
From MaRDI portal
Publication:5890493
DOI10.1145/383962.383983zbMath1333.05287MaRDI 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
68W40: Analysis of algorithms
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
68W15: Distributed algorithms
Related Items
Transitive-Closure Spanners: A Survey, A faster distributed protocol for constructing a minimum spanning tree, Sublinear fully distributed partition with applications, A parallel bio-inspired shortest path algorithm, Combinatorial algorithms for distributed graph coloring, Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models, Improved Approximation for the Directed Spanner Problem, Approximating average parameters of graphs, Graph Embedding through Random Walk for Shortest Paths Problems