From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path (Q5251623): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010833765 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1308.2644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who solved the secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered secretaries / 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 secretary problem on an unknown poset / 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: An efficient algorithm for stopping on a sink in a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best choice problem for a union of two linear orders with common maximum / 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: Q2959924 / 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: Dynamic Programming and Decision Theory / 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: The best-choice problem for partially ordered objects. / 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
Property / cites work
 
Property / cites work: Gusein-Zade problem for directed path / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best choice problem for upward directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound for Spherical Caps / rank
 
Normal rank

Latest revision as of 02:22, 10 July 2024

scientific article; zbMATH DE number 6437888
Language Label Description Also known as
English
From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
scientific article; zbMATH DE number 6437888

    Statements

    From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2015
    0 references
    directed graph
    0 references
    secretary problem
    0 references
    best choice
    0 references
    graph power
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references