Pages that link to "Item:Q1639350"
From MaRDI portal
The following pages link to A new approximation algorithm for \(k\)-set cover problem (Q1639350):
Displaying 6 items.
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing (Q3586179) (← links)
- (Q4843442) (← links)
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (Q5189513) (← links)