57 search results - page 12 / 12 » On Approximating Minimum Vertex Cover for Graphs with Perfec... |
103
click to vote
STOC
2009
ACM
16 years 2 months 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...
112
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...