188 search results - page 33 / 38 » Evolutionary Algorithms for Vertex Cover |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
116
click to vote
ECCC
2010
14 years 10 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
115
click to vote
JSAT
2010
14 years 6 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
STOC
2009
ACM
16 years 7 days ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
108
click to vote
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...