Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.
Alexandre Salles da CunhaLuidi SimonettiAbilio LucenaPublished in: INOC (2011)
Keyphrases
- clustering algorithm
- k means
- classification algorithm
- learning algorithm
- improved algorithm
- detection algorithm
- cost function
- single pass
- expectation maximization
- computational cost
- significant improvement
- objective function
- optimal solution
- np hard
- probabilistic model
- times faster
- segmentation algorithm
- optimization algorithm
- data sets
- estimation algorithm
- tree structure
- computational complexity
- theoretical analysis
- preprocessing
- input data
- linear programming
- high accuracy
- experimental evaluation