An O(n log n) algorithm for suboptimal rectilinear Steiner trees (Q4174637): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tcs.1979.1084551 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082293426 / rank | |||
Normal rank | |||
Latest revision as of 10:27, 30 July 2024
scientific article; zbMATH DE number 3609582
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n) algorithm for suboptimal rectilinear Steiner trees |
scientific article; zbMATH DE number 3609582 |
Statements
An O(n log n) algorithm for suboptimal rectilinear Steiner trees (English)
0 references
1979
0 references
Suboptimal Rectilinear Steiner Tree Algorithm
0 references
