An efficient algorithm for stopping on a sink in a directed graph
Authors:
- Wayne GoddardWGWayne Goddard
- Ewa M. KubickaEKEwa M. Kubicka
- Grzegorz KubickiGKGrzegorz Kubicki
- 1 May 2013
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 41 (3) , 238-240
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The best choice problem for upward directed graphsDiscrete Optimization, 2012
- Partially ordered secretariesElectronic Communications in Probability, 2010
- On a universal best choice algorithm for partially ordered setsRandom Structures & Algorithms, 2007
- Graph-Theoretic Generalization of the Secretary Problem: The Directed Path CaseSIAM Journal on Discrete Mathematics, 2005
- The best-choice problem for partially ordered objectsOperations Research Letters, 1999
- Partial-order analogue of the secretary problem the binary tree caseDiscrete Mathematics, 1998
- Who Solved the Secretary Problem?Statistical Science, 1989
- Dynamic Programming and Decision TheoryJournal of the Royal Statistical Society Series C: Applied Statistics, 1961