Better Gap-Hamming Lower Bounds via Better Round Elimination.
Joshua BrodyAmit ChakrabartiOded RegevThomas VidickRonald de WolfPublished in: APPROX-RANDOM (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- branch and bound algorithm
- lower and upper bounds
- optimal solution
- lower bounding
- hamming distance
- np hard
- upper and lower bounds
- quadratic assignment problem
- randomly generated problems
- elimination algorithm
- theoretical analysis
- distance measure
- worst case
- lagrangian relaxation
- optimal cost
- set of randomly generated instances