A polynomial time approximation algorithm for the two-commodity splittable flow problem.
Elke EisenschmidtUtz-Uwe HausPublished in: Math. Methods Oper. Res. (2013)
Keyphrases
- polynomial time approximation
- preprocessing
- learning algorithm
- linear programming
- dynamic programming
- np hard
- cost function
- computational cost
- computational complexity
- similarity measure
- detection algorithm
- theoretical analysis
- objective function
- vertex cover
- error bounds
- mathematical model
- worst case
- optimal solution
- search space
- segmentation algorithm
- genetic algorithm
- knapsack problem
- lower bound
- search algorithm