Approximation Algorithms for Connected Maximum Cut and Related Problems.
Mohammad Taghi HajiaghayiGuy KortsarzRobert MacDavidManish PurohitKanthi K. SarpatwarPublished in: ESA (2015)
Keyphrases
- column generation
- branch and bound
- related problems
- integrality gap
- linear programming relaxation
- approximation algorithms
- lower bound
- search algorithm
- np hard
- upper bound
- worst case
- network design problem
- special case
- minimum cost
- broadly applicable
- facility location problem
- approximation schemes
- vertex cover
- disjoint paths
- np hardness
- set cover
- approximation ratio
- primal dual
- randomized algorithms
- connected components
- genetic algorithm
- open shop
- approximation guarantees
- precedence constraints
- linear programming