4255 search results - page 15 / 851 » Cover |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
COMBINATORICS
2006
13 years 7 months ago
2006
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
JCT
2006
13 years 7 months ago
2006
The thinnest coverings of ellipsoids are studied in the Euclidean spaces of an arbitrary dimension n. Given any ellipsoid, our goal is to find the minimum number of unit balls nee...
TDHMS
2008
13 years 7 months ago
2008
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes c...