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
Latest revision as of 11:07, 30 July 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