On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem (Q1146193)
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: On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem |
scientific article; zbMATH DE number 3698961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem |
scientific article; zbMATH DE number 3698961 |
Statements
On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem (English)
0 references
1980
0 references
algorithm
0 references
Steiner tree
0 references
Voronoi diagrams
0 references
