An SST-based algorithm for the steiner problem in graphs.
John E. BeasleyPublished in: Networks (1989)
Keyphrases
- k means
- experimental evaluation
- learning algorithm
- cost function
- detection algorithm
- dynamic programming
- theoretical analysis
- graph structure
- preprocessing
- search space
- segmentation algorithm
- graph partitioning
- improved algorithm
- times faster
- optimization algorithm
- expectation maximization
- simulated annealing
- computationally efficient
- graph theoretic
- spanning tree
- minimum spanning tree
- random graphs
- hyper graph
- clustering method
- high accuracy
- np hard
- computational complexity
- search algorithm
- optimal solution