On the value of a random minimum weight Steiner tree (Q705741)
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 the value of a random minimum weight Steiner tree |
scientific article; zbMATH DE number 2133932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the value of a random minimum weight Steiner tree |
scientific article; zbMATH DE number 2133932 |
Statements
On the value of a random minimum weight Steiner tree (English)
0 references
14 February 2005
0 references
Let the edge weights of the complete graph on \(n\) vertices be chosen randomly and independently from an exponential distribution with parameter 1. Fix \(k=o(n)\) vertices. The weight of the minimum weight Steiner tree containing these vertices is approaching \((k-1)(\log n-\log k)/n\) with probability converging to 1.
0 references
random graphs
0 references
0.8560976982116699
0 references
0.8386867046356201
0 references
0.8376067280769348
0 references
0.8288518786430359
0 references
0.8219740986824036
0 references
