Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem.
Yupei XiongBruce L. GoldenEdward A. WasilPublished in: Oper. Res. Lett. (2005)
Keyphrases
- worst case
- running times
- worst case analysis
- spanning tree
- average case
- upper bound
- image segmentation
- lower bound
- error bounds
- behavior patterns
- simulated annealing
- greedy algorithm
- minimum cost
- special case
- unsupervised learning
- tabu search
- constraint satisfaction
- active learning
- lagrangian relaxation
- search algorithm
- learning algorithm