19 search results - page 1 / 4 » Hardness of Finding Independent Sets in Almost 3-Colorable G... |
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
CPC
2006
13 years 7 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...