6.893 Approximability of Optimization Problems 1 Starting Proof System


    In today's lecture, we shall show that Set-Cover cannot be approximated to within a factor of (1 ?) log 4 n for any > 0 unless NP 2 DTIME(n loglog n). As in earlier lectures, properties of PCPs will be exploited to obtain this result. Just as the small answer size was used to show the hardness of approximating Max-Sat and the c=s ratio for Clique, we shall… (More)


    • Presentations referencing similar topics