Correlated stochastic knapsack with a submodular objective
From MaRDI portal
Cites work
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Adaptivity and approximation for stochastic packing problems
- Allocating Bandwidth for Bursty Connections
- An analysis of approximations for maximizing submodular set functions—I
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Correlated stochastic knapsack with a submodular objective
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- Improved approximation results for stochastic knapsack problems
- Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Stochastic combinatorial optimization via Poisson approximation
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Symmetry and Approximability of Submodular Maximization Problems
Cited in
(2)
This page was built for publication: Correlated stochastic knapsack with a submodular objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969582)
