Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Steiner tree problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Rectilinear Steiner tree== {{main article|Rectilinear Steiner tree}} The rectilinear Steiner tree problem is a variant of the geometric Steiner tree problem in the plane, in which the [[Euclidean distance]] is replaced with the [[rectilinear distance]]. The problem arises in the [[physical design (electronics)|physical design]] of [[electronic design automation]]. In [[VLSI circuit]]s, [[wire routing]] is carried out by wires that are often constrained by design rules to run only in vertical and horizontal directions, so the rectilinear Steiner tree problem can be used to model the routing of nets with more than two terminals.{{sfnp|Sherwani|1993|p=228}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)