A linear-time 2-approximation algorithm for the watchman route problem for simple polygons.
Xuehou TanPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- minimum length
- learning algorithm
- worst case
- optimal solution
- preprocessing
- convex hull
- matching algorithm
- neural network
- k means
- linear programming
- optimization algorithm
- similarity measure
- dynamic programming
- cost function
- computational complexity
- probabilistic model
- particle swarm optimization
- np hard
- path planning
- times faster
- error bounds
- recognition algorithm
- polygonal approximation
- reinforcement learning