Tighter constant-factor time hierarchies.

Amir M. Ben-Amram

Published in: Inf. Process. Lett. (2003)

Keyphrases

constant factor
upper bound
lower bound
linear programming relaxation
approximation algorithms
worst case
branch and bound
sample complexity
objective function
lower and upper bounds
np hard
linear programming
concept classes
online learning
lagrangian relaxation
genetic algorithm
approximation guarantees