Approximation Algorithms for the Maximum Bounded Connected Bipartition Problem.
Yajie LiWeidong LiXiaofei LiuJinhua YangPublished in: AAIM (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- network design problem
- set cover
- primal dual
- approximation schemes
- facility location problem
- approximation ratio
- np hardness
- exact algorithms
- randomized algorithms
- open shop
- disjoint paths
- integrality gap
- constant factor approximation
- undirected graph
- combinatorial auctions
- constant factor
- greedy algorithm
- connected components