4255 search results - page 41 / 851 » Cover |
MP
2006
13 years 7 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
COMBINATORICS
2000
13 years 7 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
DM
2008
13 years 7 months ago
2008
For two or more classes of points in Rd with d 1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect...
MST
2011
13 years 2 months ago
2011
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
GC
2012
Springer
12 years 3 months ago
2012
Springer
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...