[p] Lower Bounds Against MCSP via the Coin Problem.
Alexander GolovnevRahul IlangoRussell ImpagliazzoValentine KabanetsAntonina KolokolovaAvishay TalPublished in: ICALP (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- quadratic assignment problem
- worst case
- vc dimension
- lower and upper bounds
- upper and lower bounds
- special case
- data structure
- optimal solution
- credit card
- lower bounding
- randomly generated problems
- image segmentation
- sample complexity
- lagrangian relaxation