A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Steiner Minimal Trees with Rectilinear Distance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n log n) algorithm for suboptimal rectilinear Steiner trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Use of Steiner's problem in suboptimal routing in rectilinear metric / rank | |||
Normal rank | |||
Latest revision as of 11:03, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem |
scientific article |
Statements
A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (English)
0 references
1990
0 references
tight worst case upper bound
0 references
heuristics
0 references
minimum rectilinear Steiner tree problem
0 references
