New approximation algorithms for the rooted Budgeted Cycle Cover problem.
Jiangkun LiPeng ZhangPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- primal dual
- approximation ratio
- exact algorithms
- undirected graph
- set cover
- approximation schemes
- open shop
- constant factor
- kernel classifiers
- network design problem
- np hardness
- multi class
- online algorithms
- precedence constraints
- resource allocation
- dynamic programming
- disjoint paths
- constant factor approximation