The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs.
Cees DuinStefan VoßPublished in: Networks (1999)
Keyphrases
- dynamic programming
- preprocessing
- clustering method
- objective function
- high precision
- high accuracy
- computational complexity
- optimal solution
- graph matching
- computational cost
- probabilistic model
- classification accuracy
- combinatorial optimization
- heuristic methods
- selection strategy
- minimum spanning tree
- search strategy
- beam search
- support vector machine
- segmentation method
- detection method
- support vector machine svm
- data sets
- experimental evaluation
- search space
- pairwise
- multiscale
- similarity measure