Scenario Submodular Cover

DOI10.1007/978-3-319-51741-4_10zbMath1484.90056arXiv1603.03158OpenAlexW2296599140MaRDI QIDQ2971162

Nathaniel Grammel, Devorah Kletenik, Patrick Lin, Lisa Hellerstein

Publication date: 4 April 2017

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items

Unnamed Item, Scenario Submodular Cover, Adaptive Submodular Ranking and Routing, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Sequential testing of complex systems: a review
• Adaptive submodular ranking
• Scenario Submodular Cover
• Learning with attribute costs
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
• Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations