On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem (Q5263800)
From MaRDI portal
scientific article; zbMATH DE number 6460035
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem |
scientific article; zbMATH DE number 6460035 |
Statements
On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem (English)
0 references
17 July 2015
0 references
wireless communication network
0 references
spanning tree
0 references
approximate algorithm
0 references
