Add to ORKGAbstract. Assuming 3-SAT formulas are hard to refute on average, Feige showed some approximation hardness results for several problems like min bisection, dense k-subgraph, max bipartite clique and the 2-catalog segmentation problem. We show a similar result for max bipartite clique, but under the assumption, 4-SAT formulas are hard to refute on average. As falsity of the 4-SAT assumption implies falsity of the 3-SAT assumption it seems that our assumption is weaker than that of Feige.
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
This thesis studies two NP-complete problems, {\it Clique} and {\it Boolean Satisfiability} (SAT), u...
Constraint satisfaction problems are some of the most well-studied NP-hard problems, 3SAT being a pr...
Håstad established that any predicate P⊆{0,1}m containing Parity of width at least three is approxim...
The theory of NP-hardness of approximation has led to numerous tight characterizations of approximab...
This talk describes Feige’s result on the hardness of approximation of set cover. We will start by f...
We show that every language in NP has a probablistic verier that checks mem-bership proofs for it us...
Clique-width is a graph parameter, defined by a composition mechanism for vertexlabeled graphs, whic...
In general, constructing a locally-optimal structure is a little harder than constructing an arbitra...
Given a graph G =(V, E), a satisfying bisection of G is a partition of the vertex set V into two set...
Given a graph G=(V,E) a clique is a maximal subset of pairwise adjacent vertices of V of size at lea...
We indicate strong non-approximability factors for central problems: N 1=4 for Max Clique; N 1=10 fo...
AbstractWe apply techniques from the theory of approximation algorithms to the problem of deciding w...
We prove that, unless any problem in NP can be solved in proba-bilistic polynomial time, for any >...
We show that for a graph G it is NP-hard to decide whether its independence number α(G) equals its c...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
This thesis studies two NP-complete problems, {\it Clique} and {\it Boolean Satisfiability} (SAT), u...
Constraint satisfaction problems are some of the most well-studied NP-hard problems, 3SAT being a pr...
Håstad established that any predicate P⊆{0,1}m containing Parity of width at least three is approxim...
The theory of NP-hardness of approximation has led to numerous tight characterizations of approximab...
This talk describes Feige’s result on the hardness of approximation of set cover. We will start by f...
We show that every language in NP has a probablistic verier that checks mem-bership proofs for it us...
Clique-width is a graph parameter, defined by a composition mechanism for vertexlabeled graphs, whic...
In general, constructing a locally-optimal structure is a little harder than constructing an arbitra...
Given a graph G =(V, E), a satisfying bisection of G is a partition of the vertex set V into two set...
Given a graph G=(V,E) a clique is a maximal subset of pairwise adjacent vertices of V of size at lea...
We indicate strong non-approximability factors for central problems: N 1=4 for Max Clique; N 1=10 fo...
AbstractWe apply techniques from the theory of approximation algorithms to the problem of deciding w...
We prove that, unless any problem in NP can be solved in proba-bilistic polynomial time, for any >...
We show that for a graph G it is NP-hard to decide whether its independence number α(G) equals its c...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
This thesis studies two NP-complete problems, {\it Clique} and {\it Boolean Satisfiability} (SAT), u...
Constraint satisfaction problems are some of the most well-studied NP-hard problems, 3SAT being a pr...