Fast Approximation Algorithm for Minimum Cost Multicommodity Flow.
Anil KamathOmri PalmonSerge A. PlotkinPublished in: SODA (1995)
Keyphrases
- minimum cost
- np hard
- approximation ratio
- network flow
- spanning tree
- undirected graph
- worst case
- approximation algorithms
- similarity measure
- dynamic programming
- computational complexity
- optimal solution
- objective function
- benchmark problems
- search space
- multicommodity flow problems
- network flow problem
- knapsack problem
- tree structure
- simulated annealing
- upper bound