Pages that link to "Item:Q2297657"
From MaRDI portal
The following pages link to An approximation algorithm for the partial covering 0-1 integer program (Q2297657):
Displaying 7 items.
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- On combinatorial approximation of covering 0-1 integer programs and partial set cover (Q1777420) (← links)
- One for the price of two: a unified approach for approximating covering problems (Q1977131) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- (Q3801338) (← links)
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (Q4427368) (← links)
- (Q4535021) (← links)