Algorithms for the minimum diameter terminal Steiner tree problem (Q489734)
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: Algorithms for the minimum diameter terminal Steiner tree problem |
scientific article; zbMATH DE number 6388502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the minimum diameter terminal Steiner tree problem |
scientific article; zbMATH DE number 6388502 |
Statements
Algorithms for the minimum diameter terminal Steiner tree problem (English)
0 references
21 January 2015
0 references
terminal Steiner tree
0 references
monopolar
0 references
dipolar
0 references
0.820844829082489
0 references
0.820634126663208
0 references
0.8169659376144409
0 references
0.8166617751121521
0 references
0.8160576820373535
0 references
