The problem of Minimal Steiner Tree is a classical and known one (NP-Complete). This problem has been used a lot in navigation of Networks. Since finding Minimal Steiner Tree is NP-Complete, there’s no Algorithm for it in multi-nominal time and we should use other Algorithms like Approximate Algorithm or Random Algorithm. This study presents a new genetic Algorithm. In the conclusion, this proposed Algorithm will be evaluated.
@artical{e582016ijcatr05081003,
Title = "The Presentation of a Genetic Algorithm to Solve Steiner Tree",
Journal ="International Journal of Computer Applications Technology and Research (IJCATR)",
Volume = "5",
Issue ="8",
Pages ="516 - 518",
Year = "2016",
Authors ="Elham Naseh
Ali Asghar Safaee"}
10.7753/IJCATR0508.1003
Editor/Reviewer login