The best choice problem for upward directed graphs (Q1926501): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2012.04.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995704185 / rank | |||
Normal rank |
Revision as of 23:17, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The best choice problem for upward directed graphs |
scientific article |
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