{"title":"New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem","authors":"Huynh Thi Thanh Binh, N. D. Nghia","doi":"10.1109/ACIIDS.2009.89","DOIUrl":null,"url":null,"abstract":"Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 ≤ D","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 First Asian Conference on Intelligent Information and Database Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACIIDS.2009.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 ≤ D
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
