Pages that link to "Item:Q634673"
From MaRDI portal
The following pages link to Approximability of sparse integer programs (Q634673):
Displayed 13 items.
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Network pollution games (Q1755784) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q6039535) (← links)
- On improved interval cover mechanisms for crowdsourcing markets (Q6164503) (← links)