Set selection under explorable stochastic uncertainty via covering techniques

DOI10.1007/978-3-031-32726-1_23zbMath1528.90169arXiv2211.01097MaRDI QIDQ6086011

Jens Schlöter, Nicole Megow

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

set coverqueriesexplorable uncertaintyset selection

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient update strategies for geometric computing with uncertainty
• Query-competitive algorithms for cheapest set problems under uncertainty
• Stochastic packing integer programs with few queries
• Approximation algorithms for covering/packing integer programs
• Minimum Spanning Tree Verification Under Uncertainty
• Covering minimum spanning trees of random subgraphs
• Shortest‐path metric approximation for random subgraphs
• Stochastic Covering and Adaptivity
• A Greedy Heuristic for the Set-Covering Problem
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
• Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
• Computing the Median with Uncertainty
• Query-Competitive Sorting with Uncertainty.
• Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries
• Stochastic Submodular Cover with Limited Adaptivity
• Analytical approach to parallel repetition
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• Query minimization under stochastic uncertainty

This page was built for publication: Set selection under explorable stochastic uncertainty via covering techniques