A tight lower bound for the hardness of clutters.
Vahan MkrtchyanHovhannes SargsyanPublished in: CoRR (2018)
Keyphrases
- lower bound
- worst case
- upper bound
- np hard
- random instances
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- phase transition
- computational complexity
- optimal solution
- objective function
- np complete
- linear programming relaxation
- upper and lower bounds
- lower bounding
- np hardness
- approximation algorithms
- learning theory
- vc dimension
- information theoretic
- competitive ratio
- cluttered environments
- fixed parameter tractable
- column generation
- sample complexity
- machine learning
- convergence rate
- scheduling problem
- randomized algorithm
- dynamic programming