New Approximation Algorithms for the Minimum Cycle Cover Problem.
Wei YuZhaohui LiuXiaoguang BaoPublished in: FAW (2018)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- undirected graph
- network design problem
- np hardness
- randomized algorithms
- exact algorithms
- open shop
- set cover
- spanning tree
- precedence constraints
- approximation ratio
- primal dual
- combinatorial auctions
- constant factor approximation
- network flow
- polynomial time approximation
- branch and bound algorithm