Downloads: 126
Research Paper | Computer Science & Engineering | India | Volume 3 Issue 5, May 2014
Relative Merits of Minimum Cost Spanning Trees and Steiner Trees
G. Anandhi [3] | S. K. Srivatsa [4]
Abstract: This paper discusses about the concepts of Minimum cost spanning tree and what happens if it is used in place of Steiner tree. We show that the MSTP is equivalent to a Steiner Tree Problem (STP) in an adequate layered graph. We also adapt the proposed approach for the Diameter-Constrained Minimum Spanning Tree Problem (DMSTP). Although the HMSTP and the DMSTP have symmetric edge costs; we will focus on so-called directed formulations.
Keywords: HMSTP Minimum Spanning Tree Problem, Subtrees, MBST Minimum Botteleneck Spanning Tree, DMSTP Diameter-Constrained Minimum Spanning Tree
Edition: Volume 3 Issue 5, May 2014,
Pages: 236 - 239
Similar Articles with Keyword 'Minimum'
Downloads: 2 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Experimental Result Paper, Computer Science & Engineering, India, Volume 11 Issue 11, November 2022
Pages: 667 - 674Exploring a Minimum Cost Solution for Traveling Salesman Problem using Parallel Simulated Annealing
Geerisha Jain | Dr. Anto S | Dewang Mehta
Downloads: 8 | Weekly Hits: ⮙2 | Monthly Hits: ⮙2
Research Proposals or Synopsis, Computer Science & Engineering, India, Volume 10 Issue 6, June 2021
Pages: 705 - 706An Analysis on Voice Assistant
Shravankumar Jha