An Efficient Method To Solve Least Cost Minimum Spanning Tree (LC-MST) Problem
| المصدر: | مجلة جامعة الملك سعود - علوم الحاسب والمعلومات |
|---|---|
| الناشر: | جامعة الملك سعود |
| المؤلف الرئيسي: | Hassan, M. R. (Author) |
| المجلد/العدد: | مج24, ع2 |
| محكمة: | نعم |
| الدولة: |
السعودية |
| التاريخ الميلادي: |
2012
|
| الصفحات: | 101 - 105 |
| DOI: |
10.33948/0584-024-002-002 |
| ISSN: |
1319-1578 |
| رقم MD: | 972783 |
| نوع المحتوى: | بحوث ومقالات |
| اللغة: | الإنجليزية |
| قواعد المعلومات: | science |
| مواضيع: | |
| كلمات المؤلف المفتاحية: |
Computer Networks | Minimum Spanning Tree | LC-MST Problem
|
| رابط المحتوى: |
| المستخلص: |
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. |
|---|---|
| ISSN: |
1319-1578 |
عناصر مشابهة
-
Reformulating XQuery Queries Using GLAV Mapping and Complex Unification
بواسطة: Benharzallah, Saber منشور: (2016) -
THE TRAVELING SALESMAN PROBLEM: LITERATURE SURVEY AND COMPARISON OF TWO COMPUTATIONAL METHODS
بواسطة: Ghalib, Hani M. منشور: (1979) -
The 0-1 Knapsack Problem on Chained-Cubic Tree Interconnection Network
بواسطة: العموش ، أحمد موسى عويس منشور: (2017) -
Neuro Wireless Vehicle's Movement Control
بواسطة: شريف، أسماء قاسم منشور: (2013) -
Solving Fuzzy Fractional Linear Programming Problems by Ranking Function Methods
بواسطة: Mitlif, Rasha Jalal منشور: (2016)
