A fast distributed approximation algorithm for minimum spanning trees (Q1954259)
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: A fast distributed approximation algorithm for minimum spanning trees |
scientific article; zbMATH DE number 6177666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast distributed approximation algorithm for minimum spanning trees |
scientific article; zbMATH DE number 6177666 |
Statements
A fast distributed approximation algorithm for minimum spanning trees (English)
0 references
20 June 2013
0 references
minimum spanning tree
0 references
distributed approximation algorithm
0 references
randomized algorithm
0 references
0 references
0 references
0 references
0.9982659816741944
0 references
0.8853113055229187
0 references
0.8797471523284912
0 references
0.8643482327461243
0 references
