A Robust and Scalable Algorithm for the Steiner Problem in Graphs.
Thomas PajorEduardo UchoaRenato F. WerneckPublished in: CoRR (2014)
Keyphrases
- times faster
- computationally efficient
- learning algorithm
- matching algorithm
- detection algorithm
- probabilistic model
- experimental evaluation
- memory efficient
- computational cost
- parameter free
- single pass
- high accuracy
- worst case
- np hard
- k means
- graph clustering
- evolutionary algorithm
- dynamic programming
- particle swarm optimization
- objective function
- clustering method
- bayesian networks
- recognition algorithm
- object tracking algorithm
- image matching
- simulated annealing
- significant improvement
- search space
- preprocessing
- feature selection