Login / Signup
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs.
Karl Bringmann
Thomas Dueholm Hansen
Sebastian Krinninger
Published in:
CoRR (2017)
Keyphrases
</>
minimum cost
directed graph
undirected graph
np hard
maximum flow
minimum cost flow
learning algorithm
computational complexity
worst case
optimization problems
approximation algorithms
network flow
graph structures