Login / Signup
Minimum cost flows over time without intermediate storage.
Lisa Fleischer
Martin Skutella
Published in:
SODA (2003)
Keyphrases
</>
minimum cost
np hard
network flow
approximation algorithms
network flow problem
spanning tree
capacity constraints
network simplex algorithm
minimum cost flow
scheduling problem
dynamic environments
undirected graph
edit operations