8 search results - page 2 / 2 » Meyniel's conjecture holds for random graphs |
116
Voted
STOC
2007
ACM
16 years 1 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...
108
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
121
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...