Pages that link to "Item:Q4575724"
From MaRDI portal
The following pages link to Partial Resampling to Approximate Covering Integer Programs (Q4575724):
Displaying 4 items.
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- (Q5009540) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)