Approximation algorithms for connected maximum cut and related problems.
MohammadTaghi HajiaghayiGuy KortsarzRobert MacDavidManish PurohitKanthi K. SarpatwarPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- related problems
- approximation algorithms
- integrality gap
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- approximation schemes
- facility location problem
- open shop
- precedence constraints
- network design problem
- np hardness
- approximation ratio
- set cover
- primal dual
- broadly applicable
- linear program
- linear programming relaxation
- undirected graph
- constant factor
- polynomial time approximation
- connected components
- scheduling problem
- randomized algorithms
- combinatorial auctions
- upper bound