A Minimum Cost Approach for Segmenting Networks of Lines.

Jan-Mark Geusebroek Arnold W. M. Smeulders Hugo Geerts

Published in: Int. J. Comput. Vis. (2001)

Keyphrases

minimum cost
np hard
approximation algorithms
capacity constraints
spanning tree
network flow problem
network flow
minimum cost flow
network simplex algorithm
complex networks
undirected graph
line segments
special case
integer programming
network structure
simulated annealing
worst case