Optimal Communication Spanning Tree Test Instances

  • Franz Rothlauf
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 104)


Searching the literature for standard test problems for the optimal communication spanning tree (OCST) problem reveals that many researchers use their private test problems which are mostly not published. As a result, the comparison of different search algorithms or representations is a difficult and time consuming task. It is not possible to check quickly if a new search method is better than the existing ones. Furthermore, applicants hesitate to use new and efficient search methods or representations if they can not be tested on a variety of different test problems and solve these problems well and reliably. Therefore, the building up of a collection of test instances for the OCST problem is necessary.


Test Problem Problem Instance Test Instance Line Type Node Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Physica-Verlag Heidelberg 2002

Authors and Affiliations

  • Franz Rothlauf
    • 1
  1. 1.Department of Information SystemsUniversity of BayreuthBayreuthGermany

Personalised recommendations