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

  • Authors:

  • Huynh Thi Thanh Binh;Nguyen Duc Nghia

  • Affiliations:

  • -;-

  • Venue:
  • ACIIDS '09 Proceedings of the 2009 First Asian Conference on Intelligent Information and Database Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

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