A Note on Set Cover Inapproximability Independent of Universe Size

  • Jelani Nelson
  • Published 2007 in Electronic Colloquium on Computational Complexity


In the set cover problem we are given a collection of m sets whose union covers [n] = {1, . . . , n} and must find a minimum-sized subcollection whose union still covers [n]. We investigate the approximability of set cover by an approximation ratio that depends only on m and observe that, for any constant c < 1/2, set cover cannot be approximated to within… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics