Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Rectilinear_Steiner_tree> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples 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 wikiPageLength "4958".
- Rectilinear_Steiner_tree wikiPageOutDegree "28".
- Rectilinear_Steiner_tree wikiPageRevisionID "700494794".
- Rectilinear_Steiner_tree wikiPageWikiLink Big_O_notation.
- Rectilinear_Steiner_tree wikiPageWikiLink Category:Geometric_algorithms.
- Rectilinear_Steiner_tree wikiPageWikiLink Category:Geometric_graphs.
- Rectilinear_Steiner_tree wikiPageWikiLink Category:NP-hard_problems.
- Rectilinear_Steiner_tree wikiPageWikiLink Category:Trees_(graph_theory).
- Rectilinear_Steiner_tree wikiPageWikiLink Computational_complexity_theory.
- Rectilinear_Steiner_tree wikiPageWikiLink Electronic_design_automation.
- Rectilinear_Steiner_tree wikiPageWikiLink Euclidean_distance.
- Rectilinear_Steiner_tree wikiPageWikiLink File:Hanan5.svg.
- Rectilinear_Steiner_tree wikiPageWikiLink Hanan_grid.
- Rectilinear_Steiner_tree wikiPageWikiLink Median.
- Rectilinear_Steiner_tree wikiPageWikiLink Minimum_spanning_tree.
- Rectilinear_Steiner_tree wikiPageWikiLink NP-hardness.
- Rectilinear_Steiner_tree wikiPageWikiLink Physical_design_(electronics).
- Rectilinear_Steiner_tree wikiPageWikiLink Rectilinear_minimum_spanning_tree.
- Rectilinear_Steiner_tree wikiPageWikiLink Routing_(electronic_design_automation).
- Rectilinear_Steiner_tree wikiPageWikiLink Selection_algorithm.
- Rectilinear_Steiner_tree wikiPageWikiLink Sorting_algorithm.
- Rectilinear_Steiner_tree wikiPageWikiLink Steiner_tree_problem.
- Rectilinear_Steiner_tree wikiPageWikiLink Taxicab_geometry.
- Rectilinear_Steiner_tree wikiPageWikiLink Time_complexity.
- Rectilinear_Steiner_tree wikiPageWikiLink Tree_(graph_theory).
- Rectilinear_Steiner_tree wikiPageWikiLink Very-large-scale_integration.
- Rectilinear_Steiner_tree wikiPageWikiLink File:1trunkStT.png.
- Rectilinear_Steiner_tree wikiPageWikiLinkText "rectilinear Steiner tree".
- Rectilinear_Steiner_tree wikiPageUsesTemplate Template:Expand_section.
- Rectilinear_Steiner_tree wikiPageUsesTemplate Template:Reflist.
- 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 hypernym Variant.
- Rectilinear_Steiner_tree type Algorithm.
- 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 Q7303182.
- Rectilinear_Steiner_tree sameAs m.0c40fs7.
- Rectilinear_Steiner_tree sameAs Q7303182.
- Rectilinear_Steiner_tree wasDerivedFrom Rectilinear_Steiner_tree?oldid=700494794.
- Rectilinear_Steiner_tree depiction Hanan5.svg.
- Rectilinear_Steiner_tree isPrimaryTopicOf Rectilinear_Steiner_tree.