An O(m(m + n log n) log(n C))-time algorithm to solve the minimum cost tension problem.
Mehdi GhiyasvandPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- np hard
- worst case
- minimum cost
- network flow problem
- computational complexity
- search space
- matching algorithm
- optimal solution
- lower bound
- dynamic programming
- minimal cost
- linear programming
- ant colony optimization
- randomly generated
- objective function
- spanning tree
- primal dual
- simulated annealing
- evolutionary algorithm
- minimum cost flow