An $$O(n(m+n\log n)\log n)$$ O ( n ( m + n log n ) log n ) time algorithm to solve the minimum cost tension problem.
Mehdi GhiyasvandPublished in: J. Comb. Optim. (2019)
Keyphrases
- worst case
- np hard
- minimum cost
- lower bound
- search space
- network flow
- knapsack problem
- alphabet size
- network flow problem
- randomly generated
- optimal solution
- approximation ratio
- approximation algorithms
- linear programming
- special case
- matching algorithm
- scheduling problem
- search algorithm
- minimum cost flow
- similarity measure