Adaptive Submodular Ranking and Routing

DOI10.1287/opre.2019.1889zbMath1457.62243arXiv1606.01530OpenAlexW3015734538MaRDI QIDQ5130512

Fatemeh Navidi, Prabhanjan Kambadur, Viswanath Nagarajan

Publication date: 4 November 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01530

zbMATH Keywords

stochastic optimizationsubmodularityapproximation algorithms

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Stochastic approximation (62L20) Statistical ranking and selection procedures (62F07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the generalized min-sum set cover problem
• When LP is the cure for your matching woes: improved bounds for stochastic matchings
• Constructing optimal binary decision trees is NP-complete
• An analysis of the greedy algorithm for the submodular set covering problem
• Preemptive and non-preemptive generalized min sum set cover
• Adaptive submodular ranking
• Approximating optimal binary decision trees
• Cores of convex games
• The polymatroid Steiner problems
• The minimum latency problem
• Minimum Latency Submodular Cover
• Scenario Submodular Cover
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• Decision trees for entity identification
• Polylogarithmic inapproximability
• Average-Case Active Learning with Costs
• Efficient Informative Sensing using Multiple Robots
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• 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”
• Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
• Multiple intents re-ranking
• Analytical approach to parallel repetition
• Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

This page was built for publication: Adaptive Submodular Ranking and Routing