An approximation hardness result for bipartite Clique
نویسندگان
چکیده
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.
منابع مشابه
Hardness of approximation of the Balanced Complete Bipartite Subgraph problem
We prove that the Maximum Balanced Complete Bipartite Subgraph (BCBS) problem is hard to approximate within a factor of 2 n) δ for some δ > 0 under the plausible assumption that 3-SAT ∈ DTIME ( 2 3/4+ ) for some > 0. We also show that it is NP -hard to approximate the BCBS problem within a constant factor under the assumption that it is NP -hard to approximate the maximum clique problem within ...
متن کاملCS 294 : PCP and Hardness of Approximation February
1. Max-Cut – problem definiton: Given an undirected graph G = (V,E), find a partition of the vertex set V = S ∪ S̄ that maximizes the number of cut-edges (edges with an endpoint in S and an endpoint in S̄). Examples: A clique, a bipartite graph, an odd cycle. The problem is NP-hard [7]. Can be approximated within factor 1/2 [11]. Exercise 1: Show that local search (iteratively move to the other s...
متن کاملOn the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in that we show that approximating max bipartite clique is hard under the weaker assumption, that random 4-SAT formulas are hard to refute with high probability. On the positive side we present an efficient algorithm whic...
متن کاملBi-Covering: Covering Edges with Two Small Subsets of Vertices
We study the following basic problem called Bi-Covering. Given a graph GpV,Eq, find two (not necessarily disjoint) sets A Ď V and B Ď V such that A Y B “ V and that every edge e belongs to either the graph induced by A or to the graph induced by B. The goal is to minimize maxt|A|, |B|u. This is the most simple case of the Channel Allocation problem [13]. A solution that outputs V,H gives ratio ...
متن کاملApproximating Clique and Biclique Problems
We present here 2-approximation algorithms for several node deletion and edge deletion biclique problems and for an edge deletion clique problem. The biclique problem is to find a node induced subgraph that is bipartite and complete. The objective is to minimize the total weight of nodes or edges deleted so that the remaining subgraph is bipartite complete. Several variants of the biclique prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2004