Optimal stopping for many connected components in a graph (Q6074658): Difference between revisions

@@ Property / cites work @@
+Percolation and best-choice problem for powers of paths
+Normal rank
@@ Property / cites work @@
+Maximizing the expected number of components in an online search of a graph
+Normal rank
@@ Property / cites work @@
+Sum the odds to one and stop
@@ Property / cites work: Sum the odds to one and stop / 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 @@
+Partially ordered secretaries
@@ Property / cites work: Partially ordered secretaries / rank @@
+Normal rank
@@ Property / cites work @@
+On a universal best choice algorithm for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Q4012000
@@ Property / cites work: Q4012000 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for stopping on a sink in a directed graph
+Normal rank
@@ Property / cites work @@
+From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
+Normal rank
@@ Property / cites work @@
+Poisson approximation for large deviations
@@ Property / cites work: Poisson approximation for large deviations / rank @@
+Normal rank
@@ Property / cites work @@
+Q2959924
@@ Property / cites work: Q2959924 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Decision Theory
@@ Property / cites work: Dynamic Programming and Decision Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Partial-order analogue of the secretary problem: The binary tree case
+Normal rank
@@ Property / cites work @@
+The best-choice problem for partially ordered objects.
+Normal rank
@@ Property / cites work @@
+The best choice problem for upward directed graphs
+Normal rank