A faster strongly polynomial time algorithm to solve the minimum cost tension problem.
Mehdi GhiyasvandPublished in: J. Comb. Optim. (2017)
Keyphrases
- minimum cost
- np hard
- computational complexity
- worst case
- search space
- approximation ratio
- similarity measure
- network flow
- spanning tree
- objective function
- network flow problem
- approximation algorithms
- simulated annealing
- special case
- optimal solution
- path planning
- combinatorial optimization
- convex hull
- traveling salesman problem
- matching algorithm
- weighted graph
- ant colony optimization
- exact solution
- string matching
- shortest path problem
- lower bound