A branch and cut algorithm for minimum spanning trees under conflict constraints.

Phillippe Samer Sebastián Urrutia

Published in: CoRR (2013)

Keyphrases

k means
np hard
genetic algorithm
similarity measure
objective function
optimal solution
computational complexity
minimum spanning trees
feature extraction
minimum spanning tree