On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights (Q2117617)
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: On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights |
scientific article; zbMATH DE number 7495072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights |
scientific article; zbMATH DE number 7495072 |
Statements
On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights (English)
0 references
22 March 2022
0 references
given-diameter minimum spanning tree
0 references
approximation algorithm
0 references
probabilistic analysis
0 references
asymptotic optimality
0 references
0 references
0 references
0.8325884342193604
0 references
0.7862419486045837
0 references
0.7838061451911926
0 references
0.773044228553772
0 references
