DocumentCode
2040195
Title
Using neural networks to solve Steiner Tree Problem
Author
Jin Zhongqi ; Shu Huaying ; Guo Hong Ming
Author_Institution
Dept. of Manage. Eng., Beijing Univ. of Posts & Telecommun., China
Volume
2
fYear
1993
fDate
19-21 Oct. 1993
Firstpage
807
Abstract
Based on neural computing theory, we propose an algorithm to solve the Steiner Tree Problem, an NP-complete problem. The algorithm proposed is parallel and its efficiency is verified through examples. However, two problems remain unsolved: the determination of parameters in the algorithm; and the optimal solution cannot always be found.<>
Keywords
neural nets; tree data structures; trees (mathematics); NP-complete problem; Steiner Tree Problem; neural computing theory; neural networks; optimal solution; parallel; parameters; Communication networks; Costs; Engineering management; Graph theory; Neural networks; Neurons; Polynomials; Routing; Telecommunication computing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on
Conference_Location
Beijing, China
Print_ISBN
0-7803-1233-3
Type
conf
DOI
10.1109/TENCON.1993.320136
Filename
320136
Link To Document