doi: 10.7763/IJMLC.2012.V2.154
A Heuristic Approach for Solving Minimum Routing Cost Spanning Tree Problem
Quoc Phan Tan
- Department of Information Technology of Saigon University, Ho Chi Minh city, Vietnam.
Abstract
Minimum routing cost spanning tree - MRCT is one of spanning tree optimization problems having many applications in network design. In general cases, the problem is proved as NP-hard. This paper is going to propose 2 heuristic-based algorithms used for MRCT. The general idea of those algorithms is to start at a spanning tree and step by step improve edges to obtain better spanning tree. We conducted experiment implemetations for these proposals and obtained better result than the result of current approximate algorithms.
Keywords
- Routing cost spanning tree
- heuristic algorithm
- gradually edge-removal algorithm
- gradually edge replacement algorithm
How to Cite
Quoc Phan Tan, "A Heuristic Approach for Solving Minimum Routing Cost Spanning Tree Problem," International Journal of Machine Learning, vol. 2, no. 4, pp. 406-409, 2012. https://doi.org/10.7763/IJMLC.2012.V2.154
Copyright & License
Copyright © 2012 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).