Approximation Algorithms for Connected Maximum Cut and Related Problems.
MohammadTaghi HajiaghayiGuy KortsarzRobert MacDavidManish PurohitKanthi K. SarpatwarPublished in: CoRR (2015)
Keyphrases
- related problems
- approximation algorithms
- integrality gap
- np hard
- special case
- worst case
- vertex cover
- set cover
- facility location problem
- approximation ratio
- minimum cost
- primal dual
- network design problem
- approximation schemes
- randomized algorithms
- broadly applicable
- open shop
- linear program
- precedence constraints
- linear programming relaxation
- learning algorithm
- approximation guarantees
- constant factor
- undirected graph
- linear programming
- connected components