A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170)
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 6732323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem |
scientific article; zbMATH DE number 6732323 |
Statements
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (English)
0 references
19 June 2017
0 references
communication spanning tree problem
0 references
polynomial approximation scheme
0 references
metric problem
0 references
0 references
0 references
0.99999994
0 references
0.95021623
0 references
0.9411608
0 references
0.9003637
0 references
0.88933533
0 references
0.88179433
0 references
0.8812685
0 references
0.8800137
0 references
0.8722785
0 references
