| http://dbpedia.org/ontology/abstract
|
The rectilinear Steiner tree problem, mini … 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.ding geometric points in the design plane.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Hanan5.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
27561614
|
| http://dbpedia.org/ontology/wikiPageLength
|
5083
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1089617767
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Rectilinear_minimum_spanning_tree +
, http://dbpedia.org/resource/VLSI_circuit +
, http://dbpedia.org/resource/Euclidean_distance +
, http://dbpedia.org/resource/Hanan_grid +
, http://dbpedia.org/resource/File:Hanan5.svg +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Sorting_algorithm +
, http://dbpedia.org/resource/Category:Geometric_algorithms +
, http://dbpedia.org/resource/Linear_time +
, http://dbpedia.org/resource/Rectilinear_distance +
, http://dbpedia.org/resource/NP-hard +
, http://dbpedia.org/resource/Big_O_notation +
, http://dbpedia.org/resource/Electronic_design_automation +
, http://dbpedia.org/resource/Wire_routing +
, http://dbpedia.org/resource/Steiner_tree_problem +
, http://dbpedia.org/resource/Category:Geometric_graphs +
, http://dbpedia.org/resource/Selection_algorithm +
, http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
, http://dbpedia.org/resource/Minimum_spanning_tree +
, http://dbpedia.org/resource/Physical_design_%28electronics%29 +
, http://dbpedia.org/resource/File:1trunkStT.png +
, http://dbpedia.org/resource/Median +
, http://dbpedia.org/resource/Category:NP-hard_problems +
, http://dbpedia.org/resource/Tree_%28graph_theory%29 +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Expand_section +
, http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Geometric_algorithms +
, http://dbpedia.org/resource/Category:NP-hard_problems +
, http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
, http://dbpedia.org/resource/Category:Geometric_graphs +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Variant +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Rectilinear_Steiner_tree?oldid=1089617767&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Hanan5.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/1trunkStT.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Rectilinear_Steiner_tree +
|
| owl:sameAs |
http://dbpedia.org/resource/Rectilinear_Steiner_tree +
, http://yago-knowledge.org/resource/Rectilinear_Steiner_tree +
, http://www.wikidata.org/entity/Q7303182 +
, http://rdf.freebase.com/ns/m.0c40fs7 +
, https://global.dbpedia.org/id/4twiY +
|
| rdf:type |
http://dbpedia.org/class/yago/Graph107000195 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Difficulty114408086 +
, http://dbpedia.org/class/yago/WikicatGeometricAlgorithms +
, http://dbpedia.org/class/yago/Act100030358 +
, http://dbpedia.org/class/yago/Attribute100024264 +
, http://dbpedia.org/class/yago/State100024720 +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/Communication100033020 +
, http://dbpedia.org/class/yago/Problem114410605 +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/WikicatNP-hardProblems +
, http://dbpedia.org/class/yago/Condition113920835 +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/VisualCommunication106873252 +
, http://dbpedia.org/class/yago/WikicatGeometricGraphs +
|
| rdfs:comment |
The rectilinear Steiner tree problem, mini … 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).s plus some extra points (Steiner points).
|
| rdfs:label |
Rectilinear Steiner tree
|
