15 search results - page 3 / 3 » The Resolution Complexity of Independent Sets and Vertex Cov... |
STOC
2009
ACM
14 years 5 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
DCOSS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
COLT
1993
Springer
13 years 9 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
STOC
2009
ACM
14 years 5 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...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...