Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259)
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: Approximating Steiner trees and forests with minimum number of Steiner points |
scientific article; zbMATH DE number 6957139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating Steiner trees and forests with minimum number of Steiner points |
scientific article; zbMATH DE number 6957139 |
Statements
Approximating Steiner trees and forests with minimum number of Steiner points (English)
0 references
17 October 2018
0 references
wireless networks
0 references
unit-disc graph
0 references
Steiner tree
0 references
Steiner forest
0 references
2-connectivity
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0.9350988864898682
0 references
0.8402513265609741
0 references
0.8401973247528076
0 references
0.8335187435150146
0 references
