823 search results - page 7 / 165 » Stateful Subset Cover |
DM
2010
14 years 11 months ago
2010
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
102
click to vote
STOC
2003
ACM
15 years 5 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
MST
2010
14 years 10 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
101
click to vote
JCO
2010
14 years 10 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
CCCG
2007
15 years 1 months ago
2007
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured