12 search results - page 3 / 3 » Hybrid evolutionary algorithms on minimum vertex cover for r... |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
STOC
2009
ACM
14 years 10 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...