A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)
Andrea S. LaPaughPublished in: FOCS (1980)
Keyphrases
- extended abstract
- worst case
- dynamic programming
- computational complexity
- cost function
- learning algorithm
- optimal solution
- globally optimal
- optimization algorithm
- np hard
- recognition algorithm
- objective function
- ant algorithm
- detection algorithm
- significant improvement
- simulated annealing
- path planning
- closed form
- approximation ratio
- evolutionary algorithm
- segmentation algorithm
- expectation maximization
- greedy algorithm
- probabilistic model
- special case
- space complexity
- polynomial size