A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem.
Nikhil BansalJohn KuszmaulWilliam KuszmaulPublished in: CoRR (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- lower and upper bounds
- optimal solution
- multi dimensional
- lower bounding
- upper and lower bounds
- shortest path
- np hard
- objective function
- mobile robot
- similarity measure
- learning algorithm
- neural network
- lagrangian relaxation
- online algorithms
- database