Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,252,758 papers from all fields of science
Search
Sign In
Create Free Account
Steiner tree problem
Known as:
Steiner ratio
, K-node-connected Steiner network problem
, K-vertex-connected Steiner network problem
Expand
The Steiner tree problem, motorway problem, or minimum Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Angelika Steger
Approximation algorithm
Combinatorial optimization
Decision problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Analysis of a conducting channel at the native zinc oxide surface
O. Schmidt
,
Arnd Willy Walter Geis
,
+5 authors
G. Döhler
2006
Corpus ID: 14571128
Highly Cited
2006
Highly Cited
2006
Formation of a ZnS∕Zn(S,O) bilayer buffer on CuInS2 thin film solar cell absorbers by chemical bath deposition
M. Bär
,
A. Ennaoui
,
+6 authors
M. Lux-Steiner
2006
Corpus ID: 4048178
The application of Zn compounds as buffer layers was recently extended to wide-gap CuInS2 (CIS) based thin film solar cells…
Expand
Highly Cited
2004
Highly Cited
2004
Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
Alper Üngör
Computational geometry
2004
Corpus ID: 10124011
Highly Cited
2004
Highly Cited
2004
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
A. Haghighat
,
K. Faez
,
M. Dehghan
,
A. Mowlaei
,
Y. Ghahremani
Computer Communications
2004
Corpus ID: 14140610
2003
2003
On the Full and Bottleneck Full Steiner Tree Problems
Yen Hung Chen
,
C. Lu
,
C. Tang
International Computing and Combinatorics…
2003
Corpus ID: 9691733
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…
Expand
1997
1997
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice
Ulrich Fößmeier
,
M. Kaufmann
Embedded Systems and Applications
1997
Corpus ID: 17604913
The rectilinear Steiner tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. The…
Expand
1995
1995
On Steiner tree problem with 45/spl deg/ routing
D. T. Lee
,
Chin-Fang Shen
,
Cheng-Liang Ding
International Symposium on Circuits and Systems
1995
Corpus ID: 43852487
We consider Steiner minimal trees (SMT) in the plane where the orientations of interconnection are restricted to be either…
Expand
1986
1986
A Greedy Heuristic for the Rectilinear Steiner Tree Problem
M. Bern
,
M. D. Carvalho
1986
Corpus ID: 117800118
Clark Thompson recently suggested a very natural "greedy" heuristic for the rectilinear Steiner problem (RSP), analogous to…
Expand
Highly Cited
1977
Highly Cited
1977
The Rectilinear Steiner Problem is NP-Complete
M. Garey
,
David S. Johnson
1977
Corpus ID: 117106880
Highly Cited
1938
Highly Cited
1938
Studies in Salt-Marsh Ecology Sections I to III
B. V. J. Chapman
,
V. J. Chapman
1938
Corpus ID: 87041699
FROM time to time the principal salt marsh areas of England have been subject to investigation, and a considerable body of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE