An Approximate Algorithm for Solving the Watchman Route Problem.
Fajie LiReinhard KlettePublished in: RobVis (2008)
Keyphrases
- learning algorithm
- optimization algorithm
- cost function
- experimental evaluation
- improved algorithm
- dynamic programming
- k means
- significant improvement
- theoretical analysis
- segmentation algorithm
- np hard
- search space
- preprocessing
- computational complexity
- similarity measure
- high accuracy
- objective function
- input data
- exact solution
- times faster
- matching algorithm
- tree structure
- data sets
- particle swarm optimization
- linear programming
- worst case
- computational cost
- data structure
- feature selection
- neural network