An algorithm for the steiner problem in graphs.
M. L. ShoreLeslie R. FouldsPeter B. GibbonsPublished in: Networks (1982)
Keyphrases
- preprocessing
- spanning tree
- np hard
- optimization algorithm
- times faster
- learning algorithm
- cost function
- dynamic programming
- optimal solution
- computational complexity
- k means
- worst case
- particle swarm optimization
- graph theoretical
- segmentation algorithm
- graph structure
- improved algorithm
- probabilistic model
- search space
- similarity measure
- linear programming
- input data
- high accuracy
- computationally efficient
- theoretical analysis
- computational cost
- clustering method
- matching algorithm
- experimental evaluation
- recognition algorithm
- significant improvement
- data sets