Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609)
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: Steiner tree problem with minimum number of Steiner points and bounded edge-length |
scientific article; zbMATH DE number 6594016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steiner tree problem with minimum number of Steiner points and bounded edge-length |
scientific article; zbMATH DE number 6594016 |
Statements
Steiner tree problem with minimum number of Steiner points and bounded edge-length (English)
0 references
16 June 2016
0 references
approximation algorithms
0 references
Steiner minimum trees
0 references
VLSI design
0 references
WDM optimal networks
0 references
wireless communications
0 references
0.8947482705116272
0 references
0.8945358991622925
0 references
0.875636100769043
0 references
0.875598132610321
0 references
