Wamiliana, Wamiliana (2013) COMPUTATIONAL ASPECTS OF MODIFIED KRUSKAL ALGORITHM FOR DIAMETER RESTRICTED MINIMUM SPANNING TREE PROBLEM. In: The Fifth International Conference on Numerical Optimization and Operations Research, 26 — 27 June 2013, Aceh Besar.

Computational Aspects of Modified Kruskal Algorithm for Diameter Restricted MST.pdf

Download (3MB) | Preview


The Diameter Restricted Minimum Spanning Tree Problem (DRMST) is a problem of finding a minimum weight spanning tree (where every edge has associated weight and a positive integer d ), having diameter at most d. Typically this problem arises when we are seeking the minimum length (for instance: cable or distance needed to connect between to terminals or cities, etc). In this paper we will discuss the modification of Kruskal' algorithm applied to DRMST and show the results. Keywords: diameter restricted, minimum spanning tree, Kruskal's algorithm.

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:07
Last Modified: 20 Jul 2016 04:18
URI: http://repository.lppm.unila.ac.id/id/eprint/185

Actions (login required)

View Item View Item