The following pages link to (Q3191563):
Displaying 9 items.
- Network pollution games (Q1755784) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- New Results for Network Pollution Games (Q2817847) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
