59 search results - page 2 / 12 » Red-blue covering problems and the consecutive ones property |
ALGORITHMICA
2007
13 years 5 months ago
2007
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
DISOPT
2006
13 years 4 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
DM
2008
13 years 4 months ago
2008
In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...