Solving bounded diameter minimum spanning tree problem using hybrid genetic algorithm with modified kruskal approach
Loading...
Date
2011-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Terengganu: Universiti Malaysia Terengganu
Abstract
The bounded diameter minimum spanning tree (BDMST) problem is a combinatorial optimization problem in graph theory which has its main application in network design. The goal of this problem is to find a minimum cost of all spanning trees in the graph where the number of edges between any pair of nodes, is limited by a given constant.
Description
Keywords
QA 402.5 .A7 2011, Ardiansyah, Tesis FST 2010