The submodularity of two-stage stochastic maximum-weight independent set problems
From MaRDI portal
Publication:2089673
Recommendations
Cites work
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- An analysis of approximations for maximizing submodular set functions—I
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Computational complexity of stochastic programming problems
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- Deterministic Algorithms for Submodular Maximization Problems
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Matroids and the greedy algorithm
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- On the random 2-stage minimum spanning tree
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Parametric monotone function maximization with matroid constraints
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust monotone submodular function maximization
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem
- Theory and applications of robust optimization
- Two-stage stochastic max-weight independent set problems
Cited in
(2)
This page was built for publication: The submodularity of two-stage stochastic maximum-weight independent set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089673)
