Weak compositions and their applications to polynomial lower bounds for kernelization.
Danny HermelinXi WuPublished in: SODA (2012)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- average case complexity
- objective function
- optimal solution
- lower and upper bounds
- quadratic assignment problem
- low order
- vc dimension
- randomly generated problems
- upper and lower bounds
- linear programming relaxation
- neural network
- set of randomly generated instances
- constant factor approximation algorithm
- efficient learning
- lower bounding
- worst case