Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290)
From MaRDI portal
!
WARNING
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 5682930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation |
scientific article; zbMATH DE number 5682930 |
Statements
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (English)
0 references
18 March 2010
0 references
maximum spanning tree
0 references
0 references
0.8797566890716553
0 references
0.8265503644943237
0 references
0.8114922046661377
0 references
0.8093034625053406
0 references
0.7857719659805298
0 references
