Approximation algorithms for sorting by signed short reversals.
Gustavo Rodrigues GalvãoZanoni DiasPublished in: BCB (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- np hardness
- worst case
- set cover
- primal dual
- open shop
- approximation ratio
- network design problem
- facility location problem
- exact algorithms
- randomized algorithms
- approximation guarantees
- linear programming
- constant factor
- constant factor approximation
- combinatorial auctions
- undirected graph
- branch and bound algorithm
- computational complexity
- learning algorithm