Sciweavers

12 search results - page 3 / 3
» Hybrid evolutionary algorithms on minimum vertex cover for r...
Sort
View
FOCS
2008
IEEE
13 years 10 months ago
Constant-Time Approximation Algorithms via Local Improvements
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...
Huy N. Nguyen, Krzysztof Onak
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 4 months ago
CSP gaps and reductions in the lasserre hierarchy
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...
Madhur Tulsiani