An Approximation Algorithm for Manhattan Routing (Extended Abstract)
Brenda S. BakerSandeep N. BhattFrank Thomson LeightonPublished in: STOC (1983)
Keyphrases
- extended abstract
- experimental evaluation
- k means
- computational complexity
- optimization algorithm
- dynamic programming
- probabilistic model
- preprocessing
- significant improvement
- times faster
- matching algorithm
- classification algorithm
- closed form
- simulated annealing
- error bounds
- np hard
- learning algorithm
- objective function
- similarity measure
- convergence rate
- path planning
- improved algorithm
- monte carlo
- detection algorithm
- computationally efficient
- high accuracy
- worst case
- cost function
- search space