The probabilistic minimum spanning tree problem (Q3481518)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4152178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The probabilistic minimum spanning tree problem |
scientific article; zbMATH DE number 4152178 |
Statements
The probabilistic minimum spanning tree problem (English)
0 references
1990
0 references
probabilistic variation
0 references
minimal spanning tree
0 references
minimal expected length
0 references
NP-hard
0 references
a priori optimization
0 references
0.9774283
0 references
0.9479382
0 references
0.9451802
0 references
0.92803526
0 references
0.9247844
0 references
0.9233502
0 references
0 references
0.9222461
0 references
0.91578037
0 references
0.9155414
0 references
