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
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01784988 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021624778 / rank | |||
Normal rank | |||
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
