The importance of being biased

Authors:
Irit Dinur;Shmuel Safra
Affiliations:
Institute for Advanced Study, Princeton NJ;Tel-Aviv University, Tel Aviv, Israel
Venue:
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Year:
2002

Citing 14
Cited 76

Self-testing/correcting with applications to numerical problems

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complete intersection theorem for systems of finite sets

European Journal of Combinatorics
Approximation algorithms for Steiner and directed multicuts

Journal of Algorithms
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Non-approximability results for optimization problems on bounded degree instances

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some Further Approximation Algorithms for the Vertex Cover Problem

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Approximating MIN k-SAT

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A new multilayered PCP and the hardness of hypergraph vertex cover

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Inapproximability results for equations over finite groups

Theoretical Computer Science - Special issue on automata, languages and programming
Asymmetric k-center is log* n-hard to approximate

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Testing juntas

Journal of Computer and System Sciences - Special issue on FOCS 2002
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004

ACM Computing Surveys (CSUR)
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs

ACM SIGACT News
Approximating vertex cover on dense graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetric k-center is log* n-hard to approximate

Journal of the ACM (JACM)
On approximating minimum vertex cover for graphs with perfect matching

Theoretical Computer Science
Noise stability of functions with low in.uences invariance and optimality

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Katona-type proof of an Erdős-Ko-Rado-type theorem

Journal of Combinatorial Theory Series A
Ordering by weighted number of wins gives a good ranking for weighted tournaments

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complexity of approximating bounded variants of optimization problems

Theoretical Computer Science - Foundations of computation theory (FCT 2003)
The NP-completeness column: The many limits on approximation

ACM Transactions on Algorithms (TALG)
Approximating the minimum weight weak vertex cover

Theoretical Computer Science - Computing and combinatorics
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover

Discrete Applied Mathematics
Invitation to data reduction and problem kernelization

ACM SIGACT News
How to rank with few errors

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved approximation results for the stable marriage problem

ACM Transactions on Algorithms (TALG)
Crown reductions for the Minimum Weighted Vertex Cover problem

Discrete Applied Mathematics
On the approximability of influence in social networks

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Aggregating inconsistent information: Ranking and clustering

Journal of the ACM (JACM)
On the Minimum Hitting Set of Bundles Problem

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Distributed weighted vertex cover via maximal matchings

ACM Transactions on Algorithms (TALG)
Approximation hardness of dominating set problems in bounded degree graphs

Information and Computation
Matching Techniques Ride to Rescue OLED Displays

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Tolerant Linearity Testing and Locally Testable Codes

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the minimum hitting set of bundles problem

Theoretical Computer Science
On problems without polynomial kernels

Journal of Computer and System Sciences
Priority algorithms for graph optimization problems

Theoretical Computer Science
Approximation for minimum total dominating set

Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Vertex cover approximations on random graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Approximation of partial capacitated vertex cover

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Inapproximability results for equations over infinite groups

Theoretical Computer Science
Ordering by weighted number of wins gives a good ranking for weighted tournaments

ACM Transactions on Algorithms (TALG)
On the approximability of the vertex cover and related problems

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
On the inapproximability of vertex cover on k-partite k-uniform hypergraphs

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The checkpoint problem

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximated distributed minimum vertex cover algorithms for bounded degree graphs

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Minimum vertex cover in rectangle graphs

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications

SIAM Journal on Discrete Mathematics
Minimum vertex cover in rectangle graphs

Computational Geometry: Theory and Applications
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs

Studies in complexity and cryptography
Approximating the influence of monotone boolean functions in O(√n) query complexity

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A primal-dual approximation algorithm for the vertex cover P3 problem

Theoretical Computer Science
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs

Journal of Combinatorial Optimization
Approximation of Partial Capacitated Vertex Cover

SIAM Journal on Discrete Mathematics
The approximability of the exemplar breakpoint distance problem

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A better approximation ratio for the vertex cover problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the hardness of embeddings between two finite metrics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On LP-based approximability for strict CSPs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Parametric duality and kernelization: lower bounds and upper bounds on kernel size

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Priority algorithms for graph optimization problems

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
The multi-radius cover problem

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover

ACM Transactions on Algorithms (TALG)
Rounding to an integral program

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Vertex cover approximations: experiments and observations

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Extension of the nemhauser and trotter theorem to generalized vertex cover with applications

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity

The Journal of Machine Learning Research
An edge-reduction algorithm for the vertex cover problem

Operations Research Letters
Minimum weight covering problems in stochastic environments

Information Sciences: an International Journal
The checkpoint problem

Theoretical Computer Science
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity

ACM Transactions on Computation Theory (TOCT)
Fast fusion moves for multi-model estimation

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
New results on polynomial inapproximability and fixed parameter approximability of edge dominating set

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Comparable dependencies over heterogeneous data

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.01

Visualization

Abstract

(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.