New approximation algorithms for the minimum cycle cover problem.
Wei YuZhaohui LiuXiaoguang BaoPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- special case
- vertex cover
- worst case
- open shop
- facility location problem
- primal dual
- exact algorithms
- set cover
- randomized algorithms
- np hardness
- network design problem
- approximation ratio
- precedence constraints
- constant factor approximation
- network flow
- undirected graph
- spanning tree
- approximation schemes
- combinatorial auctions
- learning algorithm
- approximation guarantees
- polynomial time approximation
- theoretical analysis
- optimal solution