Linear-Time 2-Approximation Algorithm for the Watchman Route Problem.
Xuehou TanPublished in: TAMC (2006)
Keyphrases
- recognition algorithm
- preprocessing
- expectation maximization
- experimental evaluation
- dynamic programming
- approximation ratio
- learning algorithm
- worst case
- computational cost
- np hard
- detection algorithm
- k means
- error bounds
- computational complexity
- clustering method
- times faster
- high accuracy
- significant improvement
- simulated annealing
- input data
- probabilistic model
- objective function
- particle swarm optimization
- segmentation algorithm
- optimization algorithm
- multi objective
- shortest path
- matching algorithm
- closed form
- evolutionary algorithm
- search space
- optimal solution
- optimal path