8 citations · 9 across the 2 of their papers we have counts for
1 paper · 1 filter
Omid Amini, Fedor V. Fomin, Saket Saurabh
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite…