The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm.
Corinne FeremansMartine LabbéGilbert LaportePublished in: Networks (2004)
Keyphrases
- single pass
- experimental evaluation
- times faster
- convex hull
- k means
- learning algorithm
- recognition algorithm
- computational cost
- dynamic programming
- np hard
- computational complexity
- worst case
- input data
- neural network
- image processing
- improved algorithm
- selection algorithm
- dual space
- detection algorithm
- optimization algorithm
- theoretical analysis
- computationally efficient
- expectation maximization
- maximum likelihood
- least squares
- data analysis
- segmentation algorithm
- clustering method
- path planning
- estimation algorithm
- relative entropy
- multiscale