A threshold of ln n for approximating set cover

  title={A threshold of ln n for approximating set cover},
  author={Uriel Feige},
  journal={J. ACM},
  • U. Feige
  • Published 1 July 1998
  • Physics
  • J. ACM
Given a collection<inline-equation><f> <sc>F</sc></f></inline-equation> of subsets of <?Pub Fmt italic>S<?Pub Fmt /italic> ={1,…,<?Pub Fmt italic>n<?Pub Fmt /italic>}, <?Pub Fmt italic>setcover<?Pub Fmt /italic> is the problem of selecting as few as possiblesubsets from <inline-equation> <f> <sc>F</sc></f></inline-equation> such that their union covers<?Pub Fmt italic>S,<?Pub Fmt /italic>, and <?Pub Fmt italic>maxk-cover<?Pub Fmt /italic> is the problem of selecting<?Pub Fmt italic>k<?Pub Fmt… 

Ranking with submodular valuations

The main result is an O(ln(1/∈)-approximation algorithm for the problem of ranking with submodular valuations, where ε is the smallest nonzero marginal value that any function may gain from some element.

The online set cover problem

An O(log n log m/log log m + log log n) competitive deterministic algorithm for the set cover problem is presented, and a nearly matching lower bound for all interesting values of m and n is established.

An approximation algorithm for the group Steiner problem

The first combinatorial polylogarithmic ratio approximation for the problem on trees is given, improving the best known approximation ratio (as a function of <i>n</i>) for the Covering Steiner Problem by a Θ(log log <i*n) factor over the previously best known approximator ratio [GKR98].

An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint

<p style='text-indent:20px;'>In the paper, we design an adaptive algorithm for non-submodular set function maximization over a single matroid constraint. We measure the deviation of the set function

The local lemma is tight for SAT

The bound on <i>l</i>(<i>k</i>) obtained from the Local Lemma is asymptotically optimal, i.e., the bound on L(i) = (1/<i*e</i> + <i*o·i>(1)) 2<sup><i> k</i></sup>.

Confronting hardness using a hybrid approach

It is shown that for several NP-hard problems, a given instance can either be solved exactly with substantially improved runtime, or be approximated in polynomial time with an approximation ratio exceeding that of the known or conjectured inapproximability of the problem, assuming P ≠ NP.

What cannot be computed locally!

Time lower bounds are given for the distributed approximation of minimum vertex cover (MVC) and related problems such as minimum dominating set (MDS) and the construction of maximal matchings and maximal independent sets.

Partial covering of hypergraphs

This paper studies the performance ratio of the greedy cover algorithm for this "partial vertex cover" problem and compares it to random choice and to optimal fractional cover, and proves a performance ratio bound depending only on ε > 0 for an important class of hypergraphs.

Combination can be hard: approximability of the unique coverage problem

It is shown that the inapproximability results extend to envy-free pricing, an important problem in computational economics, and how the (budgeted) unique coverage problem has close connections to other theoretical problems including max cut, maximum coverage, and radio broad-casting.

Non-approximability results for optimization problems on bounded degree instances

Some non-approximability results for restrictions of basic combinatorial optimization problems to instances of bounded “degree” or bounded ”width” are proved.



Probabilistic checking of proofs: a new characterization of NP

It is shown that approximating Clique and Independent Set, even in a very weak sense, is NP-hard, and the class NP contains exactly those languages for which membership proofs can be verified probabilistically in polynomial time.

A tight analysis of the greedy algorithm for set cover

The first substantial improvement of the 20-year-old classical harmonic upper bound,H(m), of Johnson, Lovasz, and Chvatal, is provided and the approximation guarantee for the greedy algorithm is better than the guarantee recently established by Srinivasan for the randomized rounding technique, thus improving the bounds on theintegrality gap.

Efficient probabilistically checkable proofs and applications to approximations

This work constructs multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size, and shows that approximating minimum set cover within any constant is NP-complete.

Efficient probabilistic checkable proofs and applications to approximation

We construct multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size. As a consequence, we obtain

Two-prover one-round proof systems: their power and their problems (extended abstract)

This work characterize the power of two-prover one-round MIP proof systems, and proves the effectiveness of this heuristic for several problems, such as computing the chromatic number of perfect graphs.

Zero knowledge and the chromatic number

  • U. FeigeJ. Kilian
  • Mathematics, Computer Science
    Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
  • 1996
A new technique, inspired by zero-knowledge proof systems, is presented for proving lower bounds on approximating the chromatic number of a graph, and the result matches (up to low order terms) the known gap for approximation the size of the largest independent set.

Proof verification and hardness of approximation problems

The authors improve on their result by showing that NP=PCP(logn, 1), which has the following consequences: (1) MAXSNP-hard problems do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup ePSilon / unless P =NP.

A Best Possible Heuristic for the k-Center Problem

A 2-approximation algorithm for the k-center problem with triangle inequality is presented, the key combinatorial object used is called a strong stable set, and the NP-completeness of the corresponding decision problem is proved.

A well-characterized approximation problem

It is proved that for any constant delta <1, it is NP-hard to approximate the solution of quadratic equations over the rational numbers, or over the reals, within n/sup delta /.

A Greedy Heuristic for the Set-Covering Problem

It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A when all the components of cT are the same, which reduces to a theorem established previously by Johnson and Lovasz.