Pages that link to "Item:Q5236281"
From MaRDI portal
The following pages link to On Approximating (Sparse) Covering Integer Programs (Q5236281):
Displaying 7 items.
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- (Q5077149) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
