Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,400,053 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
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
Highly Cited
2001
Highly Cited
2001
Texture Mapping with Hard Constraints
I. Eckstein
,
V. Surazhsky
,
C. Gotsman
Computer graphics forum (Print)
2001
Corpus ID: 10999401
We show how to continuously map a texture onto a 3D triangle mesh when some of the mesh vertices are constrained to have given (u…
Expand
Highly Cited
1998
Highly Cited
1998
Source-based delay-bounded multicasting in multimedia networks
C. Ravikumar
,
Rajneesh Bajpai
Computer Communications
1998
Corpus ID: 39939302
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
Highly Cited
1995
Highly Cited
1995
Calcium Regulation by Calcium-Binding Proteins in Neurodegenerative Disorders
C. Heizmann
,
K. Braun
Neuroscience Intelligence Unit
1995
Corpus ID: 28249432
1. Introduction.- 2. Structures of EF-Hand Ca2+-Binding Proteins and Annexins.- 3. Gene Structures and Chromosomal Assignments of…
Expand
Highly Cited
1989
Highly Cited
1989
New Approximation Algorithms for the Steiner Tree Problem
Bernard M. Waxman
1989
Corpus ID: 124495442
In this paper we consider several approximation algorithms for the Steiner tree problem in an attempt to find one whose worst…
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