Bayesian probing on graphs

DOI10.1007/978-3-032-28691-8_27MaRDI QIDQ7349471zbMATH OpenFDO

Authors Anupam Gupta, Benjamin Moseley, Rudy Zhou

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_27

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A stochastic probing problem with applications
• A Tight Bound for Stochastic Submodular Cover
• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• Adaptivity gaps for stochastic probing: submodular and XOS functions
• Algorithms and adaptivity gaps for stochastic probing
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Bayesian optimization
• Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
• Critical probabilities for site and bond percolation models
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
• Large components in random induced subgraphs of \(n\)-cubes
• Minimum cost adaptive submodular cover
• Pandora's box with correlations: learning and approximation
• The design of approximation algorithms

This page was built for publication: Bayesian probing on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349471)