Improved Approximation Algorithms for Sorting Unsigned Genomes by Reversals.
Chengcheng SunHaitao JiangDaming ZhuPublished in: BIBM (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- facility location problem
- vertex cover
- open shop
- worst case
- minimum cost
- exact algorithms
- np hardness
- primal dual
- approximation ratio
- network design problem
- randomized algorithms
- constant factor
- scheduling problem
- approximation schemes
- precedence constraints
- learning algorithm
- constant factor approximation
- set cover
- partial order
- dynamic programming
- lower bound