Solving packing integer programs via randomized rounding with alterations
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- Network pollution games
- Scheduling split intervals with non-uniform demands
- New results for network pollution games
- Streaming algorithms for submodular function maximization
- On k-column sparse packing programs
- Primal beats dual on online packing LPs in the random-order model
- scientific article; zbMATH DE number 1830719 (Why is no real title available?)
- Algorithms to approximate column-sparse packing problems
- Approximating sparse covering integer programs online
- \(\ell_1\)-sparsity approximation bounds for packing integer programs
- _1-sparsity approximation bounds for packing integer programs
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
- Improved parallel derandomization via finite automata with applications
This page was built for publication: Solving packing integer programs via randomized rounding with alterations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191563)