SCIS & ISIS
SCIS & ISIS 2006
Session ID : FR-J4-5
Conference information

FR-J4 Soft Computing Approaches for Systems Optimization and Analysis
A taub search algorthm for k-minimum spanning tree problems
*Hideki KatagiriMasatoshi SakawaIchiro NishizakiKosuke KatoTomohiro Hayashida
Author information
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Abstract
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.
Content from these authors
© 2006 Japan Society for Fuzzy Theory and Intelligent Informatics
Previous article Next article
feedback
Top