最小路由开销生成树算法的实验研究

2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI:10.1109/SOCPAR.2013.7054119

Quoc Phan Tan, N. D. Nghia

{"title":"最小路由开销生成树算法的实验研究","authors":"Quoc Phan Tan, N. D. Nghia","doi":"10.1109/SOCPAR.2013.7054119","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An experimental study of minimum routing cost spanning tree algorithms\",\"authors\":\"Quoc Phan Tan, N. D. Nghia\",\"doi\":\"10.1109/SOCPAR.2013.7054119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":315126,\"journal\":{\"name\":\"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCPAR.2013.7054119\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCPAR.2013.7054119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

寻找最小路由开销生成树(MRCST)的任务可以在许多网络设计问题中找到。一般情况下，MRCST问题是np困难问题。到目前为止，已经提出了几种求解该问题的算法，并在不同的数据集上对其性能进行了评价。本文简要介绍了已知的MRCST算法，并基于从文献中收集的基准实例进行了广泛的实验。此外，这篇论文也是第一个在多达1000个顶点的图上进行实验的开创性研究。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)

自引率

0.00%

发文量