Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.
Wilfredo Bardales RoncallaEduardo Sany LaberFerdinando CicalesePublished in: CoRR (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- objective function
- worst case
- quadratic assignment problem
- np hard
- convolution kernel
- integrality gap
- upper and lower bounds
- search strategies
- search space
- maximum number
- vc dimension
- lower and upper bounds
- search algorithm
- online algorithms
- multiscale
- min sum
- image processing
- data sets