6.5210 final project: randomized SSSP beyond the sorting barrier
Final project for MIT 6.5210 (Advanced Algorithms) on how a randomized single-source shortest paths algorithm can break the sorting barrier.
Final project for 6.5210 Advanced Algorithms (MIT). It explains how a randomized approach to single-source shortest paths (SSSP) can achieve bounds that go beyond the classical sorting barrier, in contrast to deterministic comparison-based formulations.
If the preview does not load in your browser, use the download button above.