Minimum-cost integer circulations in given homology classes.

Sarah Morell Ina Seidel Stefan Weltge

Published in: SODA (2021)

Keyphrases

minimum cost
minimum cost flow
np hard
spanning tree
approximation algorithms
network flow problem
network flow
capacity constraints
network simplex algorithm
undirected graph
upper bound
class labels
multistage