95 search results - page 4 / 19 » Covering a hypergraph of subgraphs |
COLOGNETWENTE
2007
13 years 9 months ago
2007
CORR
2006
Springer
13 years 7 months ago
2006
Springer
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
DM
2000
13 years 7 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
PODC
2009
ACM
14 years 8 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...