On the value of a random minimum weight Steiner tree (Q705741): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00493-004-0013-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996753220 / rank | |||
Normal rank | |||
Latest revision as of 18:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the value of a random minimum weight Steiner tree |
scientific article |
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
