## An experimental study of minimum routing cost spanning tree algorithms

- Quoc Phan Tan, Nguyen Duc Nghia
- 2013 International Conference on Soft Computing…
- 2013

In this paper, we are proposing 3algorithms in form of heuristic to solve the minimum routing cost spanning tree problem – MRCT: The idea of 1-algorithm is removing gradually bad edges until the remained graph is just a spanning tree. The idea of 2-algorithm is finding a minimum spanning tree -MST, then replace gradually bad edges of this MST with other… (More)

@inproceedings{TanAHA,
title={A Heuristic Approach for Solving the Minimum Routing Cost Spanning Tree Problem},
author={Quoc Phan Tan}
}