Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979)
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: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem |
scientific article; zbMATH DE number 5770720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem |
scientific article; zbMATH DE number 5770720 |
Statements
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (English)
0 references
15 August 2010
0 references
0 references
0.9438102
0 references
0.92968106
0 references
0.92968106
0 references
0.9275489
0 references
0.9275489
0 references
0.9265219
0 references
0.92314285
0 references
0.9199765
0 references
