A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree (Q2816044)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6600232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree |
scientific article; zbMATH DE number 6600232 |
Statements
1 July 2016
0 references
Steiner tree
0 references
minimum spanning tree
0 references
dynamic programming
0 references
Prim heuristic
0 references
heuristic algorithms
0 references
A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree (English)
0 references
0.773995041847229
0 references
0.7729717493057251
0 references
0.7685468792915344
0 references
0.7683914303779602
0 references
0.7624688148498535
0 references
