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

Συγγραφείς: Edith Cohen

Πηγή: Journal of the ACM. 47:132-166

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.cohenwang.com/edith/Papers/nobot.pdf
https://zbmath.org/1935197
https://doi.org/10.1145/331605.331610

Polylog-Time and Near-Linear Work Approximation Scheme for Undirected Shortest Paths

Συγγραφείς: Edith Cohen

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cohenwang.com/edith/Papers/nobot.pdf.

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7644; http://www.cohenwang.com/edith/Papers/nobot.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7644
http://www.cohenwang.com/edith/Papers/nobot.pdf

FAST ALGORITHMS FOR CONSTRUCTING t-SPANNERS AND PATHS WITH STRETCH t.

Συγγραφείς: Cohen, Edith

Πηγή: SIAM Journal on Computing; 1998, Vol. 28 Issue 1, p210, 27p

Θεματικοί όροι: Algorithms, Graphic methods

Hardness Self-Amplification: Simplified, Optimized, and Unified

Συγγραφείς: Hirahara, Shuichi, Shimizu, Nobutaka

Πηγή: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. :70-83

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3564246.3585189

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

Συγγραφείς: Cohen, Edith

Πηγή: Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing. :16-26

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/195058.195089