Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483904 | Journal of King Saud University - Computer and Information Sciences | 2012 | 5 Pages |
Abstract
In this paper, least-cost minimum spanning tree (LC-MST) problem is defined as a method to construct a minimum cost spanning tree that has the least-cost edges in the network by using the distance (cost) matrix. The paper presents a new algorithm based on the distance matrix to solve the LC-MST problem. The studied cases show that the presented algorithm is efficient to solve the LC-MST problem in less time. Also, the presented algorithm can be modified to solve the DC-MST (Delay Constrained-Minimum Spanning Tree) problem presented by Lee and Atiquzzaman (2007) and the MRCT (Minimum Routing Cost Tree) problem presented by Cambos and Ricardo (2008), given as the applications of the presented algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
M.R. Hassan,