Skip to search formSkip to main contentSkip to account menu

Steiner tree problem

Known as: Steiner ratio, K-node-connected Steiner network problem, K-vertex-connected Steiner network problem 
The Steiner tree problem, motorway problem, or minimum Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
The application of Zn compounds as buffer layers was recently extended to wide-gap CuInS2 (CIS) based thin film solar cells… 
2003
2003
Given a graph G = (V, E) with a length function on edges and a subset R of V, the full Steiner tree is defined to be a Steiner… 
1997
1997
The rectilinear Steiner tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. The… 
1995
1995
We consider Steiner minimal trees (SMT) in the plane where the orientations of interconnection are restricted to be either… 
1986
1986
Clark Thompson recently suggested a very natural "greedy" heuristic for the rectilinear Steiner problem (RSP), analogous to… 
Highly Cited
1977
Highly Cited
1938
Highly Cited
1938
FROM time to time the principal salt marsh areas of England have been subject to investigation, and a considerable body of…