The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm.
Leonardo Conegundes MartinezAlexandre Salles da CunhaPublished in: Discret. Appl. Math. (2014)
Keyphrases
- detection algorithm
- preprocessing
- optimization algorithm
- dynamic programming
- experimental evaluation
- times faster
- np hard
- selection algorithm
- matching algorithm
- computational complexity
- tree structure
- learning algorithm
- convergence rate
- experimental study
- computationally efficient
- particle swarm optimization
- worst case
- computational cost
- cost function
- optimal solution
- objective function
- similarity measure
- high accuracy
- optimization problems
- expectation maximization
- theoretical analysis
- segmentation algorithm
- significant improvement
- k means
- search space
- combinatorial optimization
- data sets