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.
Index Terms—Routing cost spanning tree, heuristic algorithm, gradually edge-removal algorithm, gradually edge replacement algorithm.
Quoc Phan Tan is with Department of Information Technology of Saigon University, Ho Chi Minh city, Vietnam (email: email@example.com).
Cite: Quoc Phan Tan, "A Heuristic Approach for Solving Minimum Routing Cost Spanning Tree Problem," International Journal of Machine Learning and Computing vol. 2, no. 4, pp. 406-409 , 2012.