Pages that link to "Item:Q1777420"
From MaRDI portal
The following pages link to On combinatorial approximation of covering 0-1 integer programs and partial set cover (Q1777420):
Displaying 14 items.
- On the positive-negative partial set cover problem (Q975452) (← links)
- An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality (Q2851852) (← links)
- (Q3585507) (← links)
- (Q4269169) (← links)
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (Q4427368) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- (Q4595724) (← links)
- Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
- Approximation algorithms for integer covering problems via greedy column generation (Q4846487) (← links)
- On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types (Q4965106) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
