rectilinear Steiner tree problem
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
circuit layout
wire routing |
| gptkbp:defines |
Given a set of points in the plane, find a minimum-length network of horizontal and vertical line segments connecting them, possibly adding extra points (Steiner points).
|
| gptkbp:field |
gptkb:mathematics
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
rectilinear Steiner tree problem
|
| gptkbp:property |
gptkb:NP-hard
|
| gptkbp:relatedTo |
gptkb:Steiner_tree_problem
VLSI design network design |
| gptkbp:solvedBy |
heuristics
approximation algorithms exact algorithms for small instances |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:Steiner_tree_problem
|
| gptkbp:bfsLayer |
7
|