Two-stage stochastic max-weight independent set problems
From MaRDI portal
Publication:2149870
DOI10.1007/978-3-030-92681-6_17OpenAlexW4206445703MaRDI QIDQ2149870
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_17
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Unnamed Item
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
- Computational complexity of stochastic programming problems
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Approximation via cost sharing
- Ottimizzazione Combinatoria
- An analysis of approximations for maximizing submodular set functions—I
- Deterministic Algorithms for Submodular Maximization Problems
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- Matroids and the greedy algorithm
This page was built for publication: Two-stage stochastic max-weight independent set problems
