Loading...
Please wait, while we are loading the content...
Similar Documents
A Tabu Search Algorithm for �-minimum Spanning Tree Problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Katagiri, Hideki Nishizaki, Ichiro Hayashida, Tomohiro |
| Copyright Year | 2006 |
| Abstract | A -minimum spanning tree ( -MST) problem is a combinatorial problem to seek the subtree with exactly edges in a given graph. Since the -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 algorithm for obtaining an approximate optimal solution. Blum et al. constructed several metaheuristic approaches. This paper proposes a new tabu search algorithm for -MST problems and shows that the proposed approach have an advantage for large over the existing methods. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.jstage.jst.go.jp/article/softscis/2006/0/2006_0_1524/_pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
