METHODS OF COMPUTER ORIENTED TO THE OBTAINING OF EMST TREE: A CONTRIBUTION TO THE STEINER PROBLEM
Keywords:
EMST tree, Steiner tree, genetic algorithm.Abstract
A Euclidean Minimum Spanning Tree (EMST) is a tree or subgraph without cycles, that allows to interconnect all the vertices and to diminish the length overall of the edges of a certain graph. Despite this minimization, through the addition of new vertices to the original set it is managed to carry out an optimal minimization but. These trees Trees of Steiner denominate themselves and have great applications, particularly in the design of networks of transports and communications.Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2005 Pablo López, Carlos Yañez Duràn, Luzmila Pro Concepción, Jaime Alcalde
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the Revista de investigación de Sistemas e Informática.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating its initial publication in the Revista de investigación de Sistemas e Informática (the originator of the work, journal, volume, number and date).
