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

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

引用次数: 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

查看原文本刊更多论文

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

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

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

求助全文

约1分钟内获得全文求助全文

来源期刊

2009 First Asian Conference on Intelligent Information and Database Systems

自引率

0.00%

发文量