Keywords
Steiner problems
heuristics algorithms
Optimización de redes
Problema tipo Steiner
Algoritmos heursticos
How to Cite
Abstract
This work introduced to the problem of routering and optimum design of networks of computers that must satisfy certain practical conditions of interconnectivity. This paper show an approach style Steiner problems, and search robust and more economic solutions.
References
Crescenzi, P.; Kann, V. (2005) “A compendium of NP optimization problems”. Retrieved Junio 8, 2006 from KTH NADA: http://www.nada.kth.se/ viggo/problemlist/compendium.html.
Faloutsos, M. (2004) “The Steiner’s tree problem”. Retrieved Junio 9, 2006 from Department of Computer Science and Engineering at the University of California, Riverside: http://www.cs.ucr.edu/ michalis/COURSES/240-04/steiner.html.
Kou, L.; Markowsky, G.; Berman, L. (1981) “A fast algorithm for Steiner trees”, Acta Inf. 15: 141-145.
Nesmachnow, S. (2004) “Algoritmos genéticos paralelos y su aplicación al diseño de redes de comunicación confiables”, PEDECIBA, Montevideo, Uruguay.
Nesmachnow, S.; Cancela, H.; Enrique, A. (2004) “Técnicas evolutivas aplicadas al diseño de redes de comunicaciones confiables”, Tercer Congreso Español de Metaheurísticas, Algoritmos Evolutivos y Bioinspirados, Córdoba: 388–395.
Rayward-Smith, V.J. (1983) “The computation of nearly minimal steiner trees in graphs”, Mathematics, Education, Science, Technology 14: 15-23.
Rayward-Smith, V.J.; Clare, A. (1986) “On finding Steiner vertices”, Networks 16: 283-294.
Tanenbaun, A. (1997) “Algoritmos de enrutamiento”, in: A. Tanenbaun, C. Trentacoste & N. Regina (Eds.) Redes de Computadoras, Prentice-Hall, Amsterdam: 345–365.
Takahashi, H.; Matsuyama ,A. (1980) “An approximate solution for the Steiner problem in graphs”, Mathematica Japonica 24: 573-577.