1298 search results - page 11 / 260 » The online set cover problem |
116
click to vote
SIROCCO
2010
15 years 1 months ago
2010
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
102
click to vote
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
126
click to vote
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
107
click to vote
JDA
2008
14 years 11 months ago
2008
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
COMGEO
2008
ACM
14 years 12 months ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...