Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
نویسندگان
چکیده
منابع مشابه
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al. [Constraint satisfaction: the approximability of minimization problems, Proceedings of the 12th Annual IEEE Conference on Computational Complexity, Ulm, Germany, 24–27 June, 199...
متن کاملInapproximability of Minimum Vertex Cover
Last time we examined a generic approach for inapproximability results based on the Unique Games Conjecture. Before, we had already shown that approximating MAX-3-LIN to within a constant factor larger than 12 is NP-hard. To do this we used a tweaked version of our dictatorship test that we came up with earlier in the semester. Last time we (re)proved that approximating MAX-3-LIN to within a co...
متن کاملUsing the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs
Using known results regarding PCP, we present simple proofs of the inapproximability of vertex cover for hypergraphs. Specifically, we
متن کاملMinimum k-path vertex cover
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψk(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of ψk(G) and pr...
متن کاملInapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs
We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k = 2), the minimum vertex cover can be computed in polynomial time. For k ≥ 3, this problem is known to be NP-hard. For general k, the problem was studied by Lovász [23], who gave a k2 -approximation based on the standard LP relaxation. Subsequent wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.04.039