A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.

F. Bruce Shepherd Lisa Zhang

Published in: Discret. Appl. Math. (2001)

Keyphrases

minimum cost
np hard
network flow
dynamic programming
optimal solution
network flow problem
search space
spanning tree
knapsack problem
approximation algorithms
minimum cost flow
similarity measure
approximation ratio
network design
undirected graph
weighted sum
matching algorithm