# The importance of being biased

@article{Dinur2002TheIO, title={The importance of being biased}, author={Irit Dinur and Shmuel Safra}, journal={Electron. Colloquium Comput. Complex.}, year={2002}, volume={TR01} }

(MATH) We show that the Minimum Vertex Cover problem is NP-hard to approximate to within any factor smaller than $10\sqrt{5}-21 \approx 1.36067$, improving on the previously known hardness result for a $\frac{7}{6}$ factor.

## Figures from this paper

## 235 Citations

### Vertex cover might be hard to approximate to within 2-/spl epsiv/

- Computer Science18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
- 2003

A stronger result is shown, namely, that, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

### Approximation hardness of edge dominating set problems

- Computer Science, MathematicsJ. Comb. Optim.
- 2006

It is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7-6, the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs.

### Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs

- MathematicsStudies in Complexity and Cryptography
- 2001

It is shown that Approximating the size of the minimum vertex cover in O(1)-regular hypergraphs to within a factor of 1.99999 is NP-hard.

### Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching

- Computer Science, MathematicsISAAC
- 2003

It is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7/6, and the result extends with negligible loss to bounded degree graphs and to everywhere dense graphs.

### Super-polynomial approximation branching algorithms

- Computer Science, MathematicsRAIRO Oper. Res.
- 2016

It is shown that moderately exponential and/or parameterized time approximation schemata can be derived for broad classes of combinatorial optimization problems via a well-known technique widely used for deriving exact algorithms, namely the branching tree pruning.

### Approximation Resistance by Disguising Biased Distributions

- Computer Science
- 2014

It is shown that the gap problem of some 3-XOR is NP-hard and can be solved by running Charikar\&Wirth's SDP algorithm for two rounds and the author proves that P=NP.

### Vertex cover might be hard to approximate to within 2-epsilon

- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 2008

### Complexity of approximating bounded variants of optimization problems

- Computer Science, MathematicsTheor. Comput. Sci.
- 2006

### Improved NP-Inapproximability for 2-Variable Linear Equations

- MathematicsAPPROX-RANDOM
- 2015

An instance of the 2-Lin(2) problem is a system of equations of the form "xi + xj = b (mod 2)" in which it’s possible to satisfy all but an C e fraction of the equations.

## References

SHOWING 1-10 OF 33 REFERENCES

### Approximating clique is almost NP-complete

- Mathematics[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
- 1991

The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist,…

### Clique is hard to approximate within n 1-C

- Computer Science, Mathematics
- 1996

We prove that unless N P = ZP P , Max Clique is hard to approximate in polynomial time within a factor n 1? for any > 0. This is done by, for any > 0, constructing a probabilistically checkable proof…

### Some Further Approximation Algorithms for the Vertex Cover Problem

- Mathematics, Computer ScienceCAAP
- 1983

This paper describes an approximation algorihm for the vertex cover problem which has a worst case ratio strictly smaller than 2 for graphs which don't have too many nodes and presents algorithms which improve in the case of degree bounded graphs the worst case ratios known up to now.

### Clique Is Hard to Approximate within n1-o(1)

- Computer ScienceICALP
- 2000

The reductions used to prove Max Clique cannot be approximated in polynomial time within n1-Ɛ, for any constant Ɛ > 0, unless NP = ZPP are extended and combined with a recent result of Samorodnitsky and Trevisan.

### Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs

- Mathematics, Computer ScienceSODA '00
- 2000

Improved algorithms for finding small vertex covers in bounded degree graphs and hypergraphs are obtained and an approximation algorithm for the weighted independent set problem is obtained, matching a recent result of Halldorsson.

### Some optimal inapproximability results

- Computer Science, MathematicsSTOC '97
- 1997

We prove optimal, up to an arbitrary 2 > 0, inapproximability results for Max-Ek-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations…

### A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem

- Mathematics, Computer ScienceWG
- 1983

### Non-approximability results for optimization problems on bounded degree instances

- MathematicsSTOC '01
- 2001

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

### The exact bound in the Erdös-Ko-Rado theorem for cross-intersecting families

- MathematicsJ. Comb. Theory, Ser. A
- 1989

### The influence of variables on Boolean functions

- Mathematics, Computer Science[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
- 1988

Methods from harmonic analysis are used to prove some general theorems on Boolean functions and enable them to prove theorem on the rapid mixing of the random walk on the cube and in the extremal theory of finite sets.