An experimental study of minimum routing cost spanning tree algorithms

The task of finding the Minimum Routing Cost Spanning Tree (MRCST) can be found in many network design problems. In general cases, MRCST problem is a NP-hard problem. Till now, several algorithms for solving the problem are proposed and their performance were evaluated on different data sets. This paper presents a short survey of well known MRCST algorithms and gives a report on an extensive experimentation based on benchmark instances collected from the literature. In addition, the paper is also the first pioneering research that experiment on graphs with up to 1000 vertices.