A taub search algorthm for k-minimum spanning tree problems

抄録

A k-minimum spanning tree (k-MST) problem is a combinatorial problem to seek the subtree with exactly k edges in a given graph. Since the k-MST problem is an NP-hard problem, it is difficult to solve large-scale problems within a practically feasible time. Therefore, it is important to construct an efficient approximate solution algorithm. Blum et al. constructed several metaheuristic approaches. This paper proposes a new tabu search algorithm for k-MST problems and shows that the proposed approach have an advantage for large k over the existing methods.