A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746): 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.1002/rsa.3240050405 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037448683 / rank | |||
Normal rank |
Revision as of 01:48, 20 March 2024
scientific article; zbMATH DE number 683637
Language | Label | Description | Also known as |
---|---|---|---|
English | A probably fast, provably optimal algorithm for rectilinear Steiner trees |
scientific article; zbMATH DE number 683637 |
Statements
A probably fast, provably optimal algorithm for rectilinear Steiner trees (English)
0 references
8 November 1994
0 references
rectilinear Steiner minimal tree
0 references