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

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2012.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1995704185
@@ Property / OpenAlex ID: W1995704185 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Decision Theory
@@ Property / cites work: Dynamic Programming and Decision Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Who solved the secretary problem
@@ Property / cites work: Who solved the secretary problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3921912
@@ Property / cites work: Q3921912 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012000
@@ Property / cites work: Q4012000 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial-order analogue of the secretary problem: The binary tree case
+Normal rank
@@ Property / cites work @@
+How to Choose the Best Twins
@@ Property / cites work: How to Choose the Best Twins / rank @@
+Normal rank
@@ Property / cites work @@
+The best choice problem for posets; colored complete binary trees
+Normal rank
@@ Property / cites work @@
+An Upper Bound for Spherical Caps
@@ Property / cites work: An Upper Bound for Spherical Caps / rank @@
+Normal rank
@@ Property / cites work @@
+The best-choice problem for partially ordered objects.
+Normal rank
@@ Property / cites work @@
+On a universal best choice algorithm for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Q2959924
@@ Property / cites work: Q2959924 / rank @@
+Normal rank
@@ Property / cites work @@
+The secretary problem on an unknown poset
@@ Property / cites work: The secretary problem on an unknown poset / rank @@
+Normal rank
@@ Property / cites work @@
+Partially ordered secretaries
@@ Property / cites work: Partially ordered secretaries / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
+Normal rank
@@ Property / cites work @@
+Gusein-Zade problem for directed path
@@ Property / cites work: Gusein-Zade problem for directed path / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal stopping in a search for a vertex with full degree in a random graph
+Normal rank