Polylog-time and near-linear work approximation scheme for undirected shortest paths: Polylog-time and near-linear work approximation scheme for undirected shortest paths.

Authors: Edith Cohen

Source: Journal of the ACM. 47:132-166

Subject Terms: faster sequential algorithms, transitive closure bottleneck, polylog-time randomized algorithm, Graph theory (including graph drawing) in computer science, Randomized algorithms, Analysis of algorithms, weighted undirected networks, sparse hop sets, near-linear work algorithms, Approximation algorithms

File Description: application/xml

Access URL: http://www.cohenwang.com/edith/Papers/nobot.pdf
https://zbmath.org/1935197
https://doi.org/10.1145/331605.331610