Junaidi, Akmal and Wamiliana, Wamiliana and Sakethi, Dwi and Baskoro, Edy Tri (2009) COMPUTATIONAL ASPECTS OF GREEDY ALGORITHM FOR SOLVING THE MULTI PERIOD DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM. Jurnal Sains MIPA, 14 (1). pp. 1-6. ISSN 1978-1873
|
Text
Computational Aspects of Greedy Algorithm......pdf Download (731kB) | Preview |
Abstract
Given one center already set, The multi period degree constrained minimum spanning tree problem (MPDCMST) is a problem of determining how many vertices (can be computers, cities, and so on) should be installed in a certain period in such a way so that the cost of installation is minimum. After all the periods done, all of the vertices must be in the network, and still the cost of installation must be the minimum. In addition, the network itself has a degree restriction in every vertex which limits the number of links that incident to. in this paper we will discuss the algorithm we have developed and give results on 600 random table data.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika |
| Depositing User: | WAMILIANA |
| Date Deposited: | 25 Apr 2018 08:01 |
| Last Modified: | 25 Apr 2018 08:01 |
| URI: | http://repository.lppm.unila.ac.id/id/eprint/6745 |
Actions (login required)
 |
View Item |