Thick non-crossing paths and minimum-cost flows in polygonal domains.

Valentin Polishchuk Joseph S. B. Mitchell

Published in: SCG (2007)

Keyphrases

minimum cost
np hard
approximation algorithms
spanning tree
network flow
minimum cost path
network flow problem
minimum cost flow
network simplex algorithm
capacity constraints
undirected graph
similarity measure
multi objective
np complete
shortest path