The best choice problem for upward directed graphs (Q1926501)
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 6119007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The best choice problem for upward directed graphs |
scientific article; zbMATH DE number 6119007 |
Statements
The best choice problem for upward directed graphs (English)
0 references
28 December 2012
0 references
directed graph
0 references
secretary problem
0 references
best choice
0 references
universal algorithm
0 references
0.8721463
0 references
0.8618298
0 references
0 references
0.8558295
0 references
0.85514915
0 references
0 references
0.84368765
0 references
0 references
