A parallel randomized approximation scheme for shortest paths

Authors:
Philip N. Klein;S. Sairam
Affiliations:
Brown University;Brown University
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 11
Cited 6

Finding small simple cycle separators for 2-connected planar graphs

Journal of Computer and System Sciences
Provably good routing in graphs: regular arrays

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An improved parallel algorithm that computes the BFS numbering of a directed graph

Information Processing Letters
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
The maximum concurrent flow problem

Journal of the ACM (JACM)
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
High probability parallel transitive-closure algorithms

SIAM Journal on Computing
Towards a theory of nearly constant time parallel algorithms

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A Parallel Randomized Approximation Scheme for Shortest Paths

A Parallel Randomized Approximation Scheme for Shortest Paths

On Gazit and Miller's parallel algorithm for planar separators: achieving greater efficiency through random sampling

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)
Polylog-time and near-linear work approximation scheme for undirected shortest paths

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Time-work tradeoffs for parallel algorithms

Journal of the ACM (JACM)
Polylog-time and near-linear work approximation scheme for undirected shortest paths

Journal of the ACM (JACM)
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a randomized parallel algorithm for approximate shortest path computation in an undirected weighted graph. The algorithm is based on a technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first search. It has application, e.g., in approximate solution of multicommodity flow problems with unit capacities. We also show how to adapt the algorithm to perform better for planar graphs.