On multiway cut parameterized above lower bounds.
Marek CyganMarcin PilipczukMichal PilipczukJakub Onufry WojtaszczykPublished in: ACM Trans. Comput. Theory (2013)
Keyphrases
- lower bound
- upper bound
- families of valid inequalities
- branch and bound
- integrality gap
- branch and bound algorithm
- np hard
- worst case
- linear programming relaxation
- upper and lower bounds
- objective function
- lower bounding
- lower and upper bounds
- optimal cost
- binary trees
- vc dimension
- minimum cost
- online algorithms
- special case
- set of randomly generated instances
- learning algorithm
- lagrangian relaxation
- cutting plane
- quadratic assignment problem
- optimal solution
- randomly generated problems
- database systems
- image segmentation