A Lower Bound for Lebesgue's Universal Cover Problem.
Peter BraßMehrbod SharifiPublished in: Int. J. Comput. Geom. Appl. (2005)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- optimal solution
- objective function
- np hard
- upper and lower bounds
- real time
- worst case
- polynomial approximation
- lower bounding
- lagrangian relaxation
- databases
- linear programming
- sample complexity
- data structure
- reinforcement learning
- learning algorithm
- neural network
- turing machine