New Lower Bounds for epsilon-Nets.
Andrey KupavskiiNabil H. MustafaJános PachPublished in: SoCG (2016)
Keyphrases
- lower bound
- sample complexity
- complexity analysis
- upper bound
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- np hard
- worst case
- vc dimension
- upper and lower bounds
- quadratic assignment problem
- optimal cost
- lower bounding
- linear programming relaxation
- running times
- randomly generated problems
- online algorithms
- search algorithm
- optimal solution