Approximation algorithms for sorting permutations by extreme block-interchanges.
Jayakumar PaiBhadrachalam ChitturiPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- facility location problem
- exact algorithms
- approximation schemes
- randomized algorithms
- disjoint paths
- constant factor
- primal dual
- set cover
- open shop
- undirected graph
- combinatorial auctions
- integer programming
- polynomial time approximation
- strongly np hard
- linear programming
- computational complexity
- search algorithm