) algorithm for finding the k best cuts in a network.
Horst W. HamacherPublished in: Oper. Res. Lett. (1982)
Keyphrases
- improved algorithm
- dynamic programming
- learning algorithm
- computational complexity
- times faster
- experimental evaluation
- computational cost
- bayesian networks
- cost function
- detection algorithm
- input data
- method finds
- clustering method
- worst case
- probabilistic model
- np hard
- significant improvement
- preprocessing
- computationally efficient
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- ant colony optimization
- recognition algorithm
- optimal solution
- spanning tree
- fully connected
- network parameters
- similarity measure