Minimum-cost integer circulations in given homology classes.

Ina Seidel Stefan Weltge

Published in: CoRR (2019)

Keyphrases

minimum cost
minimum cost flow
np hard
approximation algorithms
network simplex algorithm
network flow problem
network flow
spanning tree
digital images
capacity constraints
class labels
undirected graph
edit operations