Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs.

Adam Karczmarz Jakub Lacki

Published in: SOSA (2020)

Keyphrases

minimal surface
shortest path
directed graph
shortest path algorithm
shortest path problem
learning algorithm
random walk
strongly connected components
maximum flow
reinforcement learning
worst case
strongly connected
minimum length
minimum cost flow