An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem (Q3434993)
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 5149221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem |
scientific article; zbMATH DE number 5149221 |
Statements
An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem (English)
0 references
3 May 2007
0 references
minimum spanning tree
0 references
distributed algorithms
0 references
hardness of approximation
0 references
0.9957315325737
0 references
0.827861487865448
0 references
0.824360191822052
0 references
0.8116980791091919
0 references
