A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem |
scientific article; zbMATH DE number 4162669
| 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; zbMATH DE number 4162669 |
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
