Wamiliana, Wamiliana and Sakethi, Dwi and Yuniarti, Restu (2010) COMPUTATIONAL ASPECT OF WADR1 AND WADR2 ALGORITHrIS FOR THE MULTI PERIOD DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM. In: Seminar Nasional Sains MIPA dan Aplikasinya Tahun 2010 FMIPA Universitas Lampung, 8-9 Desember 2010, Bandar Lampung.
|
Text
Computational Aspects of WADR1 and WADR2 Algorithms for The Multi Periods Degree Constrained MST.pdf Download (2MB) | Preview |
Abstract
The Multi Period Degree Constrained Minimum Spanning Tree Problem (MPDCMST) is a problem of determining the total minimum installation cost in a certain network, where the installation process is divided into some periods due to the fund limitation. In addition, the network itself must maintain it reliability by restricting the number of links at every node (can be computer, city, road, and so on). In this paper we will discuss the computational aspects of two algorithms, WAD11.1 and WADR2 for the MPDCMST and compare the solutions of those two algorithms. Keywords: multi period/ degree constrained, computational aspects.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | A General Works > AC Collections. Series. Collected works |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika |
| Depositing User: | LPPM . Unila |
| Date Deposited: | 18 Jul 2016 08:25 |
| Last Modified: | 24 Mar 2017 15:40 |
| URI: | http://repository.lppm.unila.ac.id/id/eprint/186 |
Actions (login required)
 |
View Item |