Sciweavers

DISOPT
2006
155views more  DISOPT 2006»
13 years 11 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
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...
Dorit S. Hochbaum, Asaf Levin
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
13 years 11 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
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...
Jinsong Tan, Louxin Zhang