Better Gap-Hamming Lower Bounds via Better Round Elimination
Joshua BrodyAmit ChakrabartiOded RegevThomas VidickRonald de WolfPublished in: CoRR (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- worst case
- distance measure
- objective function
- upper and lower bounds
- sample complexity
- set of randomly generated instances
- optimal cost
- quadratic assignment problem
- vc dimension
- optimal solution
- online algorithms
- lower bounding
- active learning
- polynomial approximation