A robust and scalable algorithm for the Steiner problem in graphs.
Thomas PajorEduardo UchoaRenato F. WerneckPublished in: Math. Program. Comput. (2018)
Keyphrases
- minimum spanning tree
- learning algorithm
- times faster
- cost function
- dynamic programming
- preprocessing
- parameter tuning
- optimal solution
- search space
- k means
- spanning tree
- single pass
- experimental evaluation
- computational cost
- highly efficient
- recognition algorithm
- computationally efficient
- memory efficient
- parameter free
- detection algorithm
- optimization algorithm
- expectation maximization
- high accuracy
- np hard
- computational complexity
- segmentation algorithm
- tree structure
- np complete
- convergence rate
- objective function
- decision trees
- clustering algorithm
- neural network