Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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)
SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
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 optimal inapproximability results
Journal of the ACM (JACM)
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
Hardness of Approximate Hypergraph Coloring
SIAM Journal on Computing
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
Proving Integrality Gaps without Knowing the Linear Program
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
SIAM Journal on Computing
On the Hardness of Approximating Multicut and Sparsest-Cut
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
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
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for Unique Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Decision trees and influences of variables over product probability spaces
Combinatorics, Probability and Computing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A better approximation ratio for the vertex cover problem
ACM Transactions on Algorithms (TALG)
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
Non-cooperative facility location and covering games
Theoretical Computer Science
Approximating integer programs with positive right-hand sides
Information Processing Letters
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: exponential speed-up of local algorithms using non-local communication
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A linear kernel for co-path/cycle packing
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Kernelization for cycle transversal problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Inapproximability of hypergraph vertex cover and applications to scheduling problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Improved rounding for parallel repeated unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
SIAM Journal on Discrete Mathematics
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Information Processing Letters
Approximation algorithms for minimum chain vertex deletion
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximability of combinatorial problems with multi-agent submodular cost functions
ACM SIGecom Exchanges
On the hardness and approximation of minimum topic-connected overlay
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Approximating edge dominating set in dense graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Recoverable values for independent sets
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Vertex cover in graphs with locally few colors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs
Studies in complexity and cryptography
Nearly optimal NP-hardness of vertex cover on k-uniform k-partite hypergraphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the approximability of minimum topic connected overlay and its special instances
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A kernel of order 2k-clogk for vertex cover
Information Processing Letters
Strong and weak edges of a graph and linkages with the vertex cover problem
Discrete Applied Mathematics
Approximating edge dominating set in dense graphs
Theoretical Computer Science
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász-Schrijver Hierarchy
SIAM Journal on Computing
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
Bounds on locally testable codes with unique tests
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Bypassing UGC from some optimal geometric inapproximability results
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On LP-based approximability for strict CSPs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Short witnesses and accepting lassos in ω-automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science
Kernelization for cycle transversal problems
Discrete Applied Mathematics
Approximability of economic equilibrium for housing markets with duplicate houses
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Hitting diamonds and growing cacti
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Evader interdiction and collateral damage
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Controlling infection by blocking nodes and links simultaneously
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Journal of Discrete Algorithms
Approximating vertex cover in dense hypergraphs
Journal of Discrete Algorithms
Parameterized approximation algorithms for hitting set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximating minimum label s-t cut via linear programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters
Inapproximability of (1,2)-exemplar distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Vertex cover in graphs with locally few colors
Information and Computation
A hybridized tabu search approach for the minimum weight vertex cover problem
Journal of Heuristics
LP-Based covering games with low price of anarchy
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Optimizing password composition policies
Proceedings of the fourteenth ACM conference on Electronic commerce
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Analytical models for risk-based intrusion response
Computer Networks: The International Journal of Computer and Telecommunications Networking
Explicit Optimal Hardness via Gaussian Stability Results
ACM Transactions on Computation Theory (TOCT)
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Efficient simrank-based similarity join over large graphs
Proceedings of the VLDB Endowment
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
Improved Approximation of Linear Threshold Functions
Computational Complexity
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
Approximability of the vertex cover problem in power-law graphs
Theoretical Computer Science
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
On the generalized multiway cut in trees problem
Journal of Combinatorial Optimization
Inapproximability of (1,2)-Exemplar Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.01 |
Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [S. Khot, On the power of unique 2-Prover 1-Round games, in: Proc. 34th ACM Symp. on Theory of Computing, STOC, May 2002, pp. 767-775], we show that vertex cover is hard to approximate within any constant factor better than 2. We actually show a stronger result, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.