A tight lower bound for the hardness of clutters.
Vahan MkrtchyanHovhannes SargsyanPublished in: J. Comb. Optim. (2018)
Keyphrases
- lower bound
- np hard
- worst case
- upper bound
- random instances
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- optimal solution
- np hardness
- computational complexity
- cluttered environments
- phase transition
- lower bounding
- objective function
- lagrangian relaxation
- upper and lower bounds
- branch and bound method
- sample complexity
- learning theory
- scheduling problem
- constant factor
- np complete
- approximation algorithms
- knapsack problem
- competitive ratio
- constraint satisfaction