Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Rectilinear_Steiner_tree> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- Rectilinear_Steiner_tree abstract "The rectilinear Steiner tree problem, minimum rectilinear Steiner tree problem (MRST), or rectilinear Steiner minimum tree problem (RSMT) 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 may be formally stated as follows: given n points in the plane, it is required to interconnect them all by a shortest network which consists only of vertical and horizontal line segments. It can be shown that such a network is a tree whose vertices are the input points plus some extra points (Steiner points).The problem arises in the physical design of electronic design automation. In VLSI circuits, wire routing is carried out by wires running only in vertical and horizontal directions, due to high computational complexity of the task. Therefore wire length is the sum of the lengths of vertical and horizontal segments, and the distance between two pins of a net is actually the rectilinear distance ("Manhattan distance") between the corresponding geometric points in the design plane.".
- Rectilinear_Steiner_tree thumbnail Hanan5.svg?width=300.
- Rectilinear_Steiner_tree wikiPageID "27561614".
- Rectilinear_Steiner_tree wikiPageRevisionID "532872220".
- Rectilinear_Steiner_tree hasPhotoCollection Rectilinear_Steiner_tree.
- Rectilinear_Steiner_tree subject Category:Geometric_algorithms.
- Rectilinear_Steiner_tree subject Category:Geometric_graphs.
- Rectilinear_Steiner_tree subject Category:NP-hard_problems.
- Rectilinear_Steiner_tree subject Category:Trees_(graph_theory).
- Rectilinear_Steiner_tree type Abstraction100002137.
- Rectilinear_Steiner_tree type Act100030358.
- Rectilinear_Steiner_tree type Activity100407535.
- Rectilinear_Steiner_tree type Algorithm105847438.
- Rectilinear_Steiner_tree type Attribute100024264.
- Rectilinear_Steiner_tree type Communication100033020.
- Rectilinear_Steiner_tree type Condition113920835.
- Rectilinear_Steiner_tree type Difficulty114408086.
- Rectilinear_Steiner_tree type Event100029378.
- Rectilinear_Steiner_tree type GeometricAlgorithms.
- Rectilinear_Steiner_tree type GeometricGraphs.
- Rectilinear_Steiner_tree type Graph107000195.
- Rectilinear_Steiner_tree type NP-hardProblems.
- Rectilinear_Steiner_tree type Problem114410605.
- Rectilinear_Steiner_tree type Procedure101023820.
- Rectilinear_Steiner_tree type PsychologicalFeature100023100.
- Rectilinear_Steiner_tree type Rule105846932.
- Rectilinear_Steiner_tree type State100024720.
- Rectilinear_Steiner_tree type VisualCommunication106873252.
- Rectilinear_Steiner_tree type YagoPermanentlyLocatedEntity.
- Rectilinear_Steiner_tree comment "The rectilinear Steiner tree problem, minimum rectilinear Steiner tree problem (MRST), or rectilinear Steiner minimum tree problem (RSMT) 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 may be formally stated as follows: given n points in the plane, it is required to interconnect them all by a shortest network which consists only of vertical and horizontal line segments.".
- Rectilinear_Steiner_tree label "Rectilinear Steiner tree".
- Rectilinear_Steiner_tree sameAs m.0c40fs7.
- Rectilinear_Steiner_tree sameAs Q7303182.
- Rectilinear_Steiner_tree sameAs Q7303182.
- Rectilinear_Steiner_tree sameAs Rectilinear_Steiner_tree.
- Rectilinear_Steiner_tree wasDerivedFrom Rectilinear_Steiner_tree?oldid=532872220.
- Rectilinear_Steiner_tree depiction Hanan5.svg.
- Rectilinear_Steiner_tree isPrimaryTopicOf Rectilinear_Steiner_tree.