Approximation algorithms for sorting by bounded singleton moves.
Shengjun XieHaodi FengHaitao JiangDaming ZhuPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- network design problem
- disjoint paths
- primal dual
- open shop
- exact algorithms
- set cover
- undirected graph
- precedence constraints
- approximation ratio
- randomized algorithms
- constant factor approximation
- approximation guarantees
- constant factor
- np hardness
- combinatorial auctions
- polynomial time approximation
- scheduling problem