4255 search results - page 53 / 851 » Cover |
AML
2008
13 years 10 months ago
2008
Relative to a hyperstrong cardinal, it is consistent that measure one covering fails relative to HOD. In fact it is consistent that there is a superstrong cardinal and for every re...
BMCBI
2007
13 years 10 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
DAM
2008
13 years 10 months ago
2008
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...