A neural network for the Steiner minimal tree problem

DOI10.1007/BF00203241zbMath0805.68107MaRDI QIDQ1323577

Basabi Bhaumik Jayadeva

Publication date: 26 January 1995

Published in: Biological Cybernetics (Search for Journal in Brave)

zbMATH Keywords

neural networkNP-completeSteiner minimal treeminimal spanning tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Local search for the Steiner tree problem in the Euclidean plane

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• ``Neural computation of decisions in optimization problems
• Exact computation of Steiner minimal trees in the plane
• A decomposition theorem on Euclidean Steiner minimal trees
• Improved computation of plane Steiner minimal trees
• A heuristic for Euclidean and rectilinear Steiner problems
• Optimization with neural networks: A recipe for improving convergence and solution quality
• An algorithm for the steiner problem in the euclidean plane
• Steiner problem in networks: A survey
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees
• The Generation of Minimal Trees with a Steiner Topology
• Steiner tree problems

This page was built for publication: A neural network for the Steiner minimal tree problem