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
How to Cite this Article?
G. Anandhi, S. K. Srivatsa, "Relative Merits of Minimum Cost Spanning Trees and Steiner Trees", International Journal of Science and Research (IJSR), Volume 3 Issue 5, May 2014, pp. 236-239, https://www.ijsr.net/get_abstract.php?paper_id=20131621
How to Share this Article?
Similar Articles with Keyword 'Minimum'
Downloads: 3
Research Proposals or Synopsis, Computer Science & Engineering, India, Volume 10 Issue 6, June 2021
Pages: 705 - 706An Analysis on Voice Assistant
Shravankumar Jha
Downloads: 65
Research Paper, Computer Science & Engineering, China, Volume 10 Issue 1, January 2021
Pages: 1165 - 1168A Capsule Robot Attitude Transformation Perception Method based on Intestinal Fold Features
Chengcheng Yan | Yanping Hu