Approximations for a bottleneck Steiner tree problem (Q1348905)
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 1742772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximations for a bottleneck Steiner tree problem |
scientific article; zbMATH DE number 1742772 |
Statements
Approximations for a bottleneck Steiner tree problem (English)
0 references
21 May 2002
0 references
wireless communication networks
0 references
0.8802791237831116
0 references
0.8439512848854065
0 references
0.8399512767791748
0 references
0.8399512767791748
0 references
0.832323431968689
0 references
