Tight lower bounds for the asymmetric k-center problem

Eran Halperin Guy Kortsarz Robert Krauthgamer

Published in: Electron. Colloquium Comput. Complex. (2003)

Keyphrases

lower bound
upper bound
branch and bound
branch and bound algorithm
objective function
np hard
upper and lower bounds
worst case
optimal solution
lower and upper bounds
lower bounding
running times
quadratic assignment problem
sample complexity
max sat
lagrangian relaxation
machine learning
optimal cost