Combinatorial approximation algorithms for the maximum bounded connected bipartition problem.
Xiaofei LiuYajie LiWeidong LiJinhua YangPublished in: J. Comb. Optim. (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- facility location problem
- approximation ratio
- integrality gap
- exact algorithms
- primal dual
- set cover
- np hardness
- approximation schemes
- open shop
- precedence constraints
- polynomial time approximation
- combinatorial auctions