scientific article; zbMATH DE number 7650116
From MaRDI portal
Publication:5875506
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.49MaRDI QIDQ5875506
Goran Zuzic, Sahil Singla, Domagoj Bradač
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1902.01461
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic programmingmatroid intersectionadaptive strategysubmodular functions\(k\)-extendible systemsadaptivity gapsstochastic multi-value probing
Related Items (4)
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint ⋮ Better bounds on the adaptivity gap of influence maximization under full-adoption feedback ⋮ Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Price of dependence: stochastic submodular maximization with dependent items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Pairwise kidney exchange
- Improved analysis of the greedy algorithm for stochastic matching
- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline
- Submodular Stochastic Probing on Matroids
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Improved Approximation Algorithms for Stochastic Matching
- Approximating Matches Made in Heaven
- Algorithms and Adaptivity Gaps for Stochastic Probing
- Combinatorial Prophet Inequalities
- Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
- A Stochastic Probing Problem with Applications
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Multi-armed Bandits with Metric Switching Costs
- Improved Bounds in Stochastic Matching and Optimization
- Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract
- Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
- On the Adaptivity Gap of Stochastic Orienteering
- Greedy in Approximation Algorithms
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Stochastic combinatorial optimization via poisson approximation
This page was built for publication:
