On Multiway Cut Parameterized above Lower Bounds.
Marek CyganMarcin PilipczukMichal PilipczukJakub Onufry WojtaszczykPublished in: IPEC (2011)
Keyphrases
- lower bound
- upper bound
- families of valid inequalities
- branch and bound algorithm
- branch and bound
- integrality gap
- lower and upper bounds
- np hard
- linear programming relaxation
- objective function
- lower bounding
- optimal cost
- tree structures
- optimal solution
- quadratic assignment problem
- max sat
- lagrangian relaxation
- worst case
- upper and lower bounds
- randomly generated problems
- binary trees
- vc dimension
- sample complexity
- aggregate functions
- integer programming
- set of randomly generated instances
- data structure