Negative-weight single-source shortest paths in near-linear time
Can someone ELI12? How big of a deal is this for real world applications?<p>Presentation by Aaron Bernstein (coauthor) on the paper <a href="https://www.youtube.com/watch?v=Bpw3yqWT_d0">https://www.youtube.com/watch?v=Bpw3yqWT_d0</a><p>Presentation by Danupon Nanongkai (coauthor) on the paper <a href="https://www.youtube.com/watch?v=awvBpvlbG1M">https://www.youtube.com/watch?v=awvBpvlbG1M</a><p>Implementation in Java <a href="https://github.com/nevingeorge/Negative-Weight-SSSP">https://github.com/nevingeorge/Negative-Weight-SSSP</a>