Adaptive Submodular Ranking and Routing (Q5130512): Difference between revisions

@@ Property / OpenAlex ID @@
+W3015734538
@@ Property / OpenAlex ID: W3015734538 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01530
@@ Property / arXiv ID: 1606.01530 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating optimal binary decision trees
@@ Property / cites work: Approximating optimal binary decision trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365100
@@ Property / cites work: Q5365100 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple intents re-ranking
@@ Property / cites work: Multiple intents re-ranking / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417729
@@ Property / cites work: Q5417729 / rank @@
+Normal rank
@@ Property / cites work @@
+When LP is the cure for your matching woes: improved bounds for stochastic matchings
+Normal rank
@@ Property / cites work @@
+Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
+Normal rank
@@ Property / cites work @@
+The minimum latency problem
@@ Property / cites work: The minimum latency problem / rank @@
+Normal rank
@@ Property / cites work @@
+The polymatroid Steiner problems
@@ Property / cites work: The polymatroid Steiner problems / rank @@
+Normal rank
@@ Property / cites work @@
+Decision trees for entity identification
@@ Property / cites work: Decision trees for entity identification / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+Q3112637
@@ Property / cites work: Q3112637 / rank @@
+Normal rank
@@ Property / cites work @@
+Scenario Submodular Cover
@@ Property / cites work: Scenario Submodular Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Average-Case Active Learning with Costs
@@ Property / cites work: Average-Case Active Learning with Costs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
+Normal rank
@@ Property / cites work @@
+Polylogarithmic inapproximability
@@ Property / cites work: Polylogarithmic inapproximability / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing optimal binary decision trees is NP-complete
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Preemptive and non-preemptive generalized min sum set cover
+Normal rank
@@ Property / cites work @@
+Minimum Latency Submodular Cover
@@ Property / cites work: Minimum Latency Submodular Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive submodular ranking
@@ Property / cites work: Adaptive submodular ranking / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024773
@@ Property / cites work: Q3024773 / rank @@
+Normal rank
@@ Property / cites work @@
+Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations”
+Normal rank
@@ Property / cites work @@
+Cores of convex games
@@ Property / cites work: Cores of convex games / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Informative Sensing using Multiple Robots
+Normal rank
@@ Property / cites work @@
+A note on the generalized min-sum set cover problem
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank