New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem.
Jiangkun LiPeng ZhangPublished in: COCOA (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- set cover
- multi class
- facility location problem
- constant factor
- primal dual
- network design problem
- exact algorithms
- open shop
- precedence constraints
- undirected graph
- np hardness
- approximation ratio
- kernel classifiers
- approximation schemes
- online algorithms
- randomized algorithms
- integer programming
- lower bound
- closest string
- constant factor approximation