A Chronology of Set Cover Inapproximability Results

by   Erika Melder, et al.

It is well-known that an algorithm exists which approximates the NP-complete problem of Set Cover within a factor of ln(n), and it was recently proven that this approximation ratio is optimal unless P = NP. This optimality result is the product of many advances in characterizations of NP, in terms of interactive proof systems and probabilistically checkable proofs (PCP), and improvements to the analyses thereof. However, as a result, it is difficult to extract the development of Set Cover approximation bounds from the greater scope of proof system analysis. This paper attempts to present a chronological progression of results on lower-bounding the approximation ratio of Set Cover. We analyze a series of proofs of progressively better bounds and unify the results under similar terminologies and frameworks to provide an accurate comparison of proof techniques and their results. We also treat many preliminary results as black-boxes to better focus our analysis on the core reductions to Set Cover instances. The result is alternative versions of several hardness proofs, beginning with initial inapproximability results and culminating in a version of the proof that ln(n) is a tight lower bound.



There are no comments yet.


page 1

page 2

page 3

page 4


Verified Approximation Algorithms

We present the first formal verification of approximation algorithms for...

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

We show that Set Cover on instances with N elements cannot be approximat...

On the approximation ability of evolutionary optimization with application to minimum set cover

Evolutionary algorithms (EAs) are heuristic algorithms inspired by natur...

Critique of Barbosa's "P != NP Proof"

We review André Luiz Barbosa's paper "P != NP Proof," in which the class...

Tight Localizations of Feedback Sets

The classical NP-hard feedback arc set problem (FASP) and feedback verte...

A Tight Bound for Stochastic Submodular Cover

We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) ...

Agnostic Learning of Monomials by Halfspaces is Hard

We prove the following strong hardness result for learning: Given a dist...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.