求解有界直径最小生成树问题的新多父重组遗传算法

2009 First Asian Conference on Intelligent Information and Database Systems Pub Date : 2009-04-01 DOI:10.1109/ACIIDS.2009.89

Huynh Thi Thanh Binh, N. D. Nghia

{"title":"求解有界直径最小生成树问题的新多父重组遗传算法","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":"{\"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}","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

摘要

给定一个连通的、加权的无向图G=(V, E)和一个有界的图D，有界直径最小生成树问题(BDMST)在G上寻找一棵权值最小且两个顶点之间的路径不包含超过D条边的生成树。对于4≤D，这个问题是np困难的

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

查看原文本刊更多论文

New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem

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

求助全文

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

来源期刊

2009 First Asian Conference on Intelligent Information and Database Systems

自引率

0.00%

发文量