The best choice problem for upward directed graphs (Q1926501): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Dynamic Programming and Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who solved the secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-order analogue of the secretary problem: The binary tree case / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Choose the Best Twins / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best choice problem for posets; colored complete binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound for Spherical Caps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best-choice problem for partially ordered objects. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a universal best choice algorithm for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The secretary problem on an unknown poset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered secretaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gusein-Zade problem for directed path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal stopping in a search for a vertex with full degree in a random graph / rank
 
Normal rank

Latest revision as of 01:19, 6 July 2024

scientific article
Language Label Description Also known as
English
The best choice problem for upward directed graphs
scientific article

    Statements

    Identifiers