Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,332,198 papers from all fields of science
Search
Sign In
Create Free Account
Rectilinear Steiner tree
The rectilinear Steiner tree problem, minimum rectilinear Steiner tree problem (MRST), or rectilinear Steiner minimum tree problem (RSMT) is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Computational complexity theory
Electronic design automation
Euclidean distance
Minimum spanning tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction
H. Zhang
,
Dong-yi Ye
Neural computing & applications (Print)
2014
Corpus ID: 254027014
The obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem is a fundamental problem in very large-scale integrated…
Expand
2010
2010
A New Method of Rural Road Network Layout Designing in the County: Generating Algorithm of Rectilinear Steiner Tree
Xiaohu Nie
,
Shunying Zhu
,
Hong Wang
,
Fuxing Huang
International Conference on Intelligent…
2010
Corpus ID: 15898577
A new method of the rural road network layout designing in a county area is presented, which called generating algorithm of…
Expand
2007
2007
The monitoring of the rights of the child: a child rights-based approach
Tara M. Collins
2007
Corpus ID: 153016152
2000
2000
A Practical Algorithm for the Minimum Rectilinear Steiner Tree
马军
,
杨波
,
马绍汉
2000
Corpus ID: 118424731
An O(n^2) time approximation algorithm for the minimum rectilinear Steiner tree is proposed.The approximation ratio of the…
Expand
1998
1998
Algorithms for Plane Steiner Tree Problems
Martin Zachariasen
1998
Corpus ID: 2508565
Topological network design is the process of planning the layout of a network subject to constraints on topology. Applications…
Expand
1997
1997
Deep-Submicron Rectilinear Steiner Tree Problem
A. Erzin
,
Sang Ha Kim
,
Jun-Dong Cho
1997
Corpus ID: 15336578
This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree of minimum total cost (the cost…
Expand
1994
1994
1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
Marek Karpinski
,
A. Zelikovsky
Electron. Colloquium Comput. Complex.
1994
Corpus ID: 18881904
The Steiner tree problem requires to nd a shortest tree connecting a given set of terminal points in a metric space. We suggest a…
Expand
1993
1993
Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles (supercedes CS-92-39, CS-93-15, and CS-93-19)
J. L. Ganley
,
J. Cohoon
1993
Corpus ID: 9410794
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a…
Expand
1992
1992
On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension
A. Kahng
,
G. Robins
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1992
Corpus ID: 17131481
A family of examples on which a large class C of minimum spanning tree-based rectilinear Steiner tree heuristics has a…
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