Jeremiah Blocki, [email protected]: Monday @ 3:30 PM. GHC 7th floor lounge. Students can email me if they want to meet at a different time. Anvesh Komuravelli, [email protected]: Friday @ 4 ...
Abstract: We present a novel algorithm to solve the nonnegative single-source shortest path problem on road networks and other graphs with low highway dimension. After a quick preprocessing phase, we ...
Abstract: In undirected graphs with real non-negative weights, we give a new randomized algorithm for the single-source shortest path (SSSP) problem with running time ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results