A fast approximation algorithm for the multicovering problem
Discrete Applied Mathematics
Matching is as easy as matrix inversion
Combinatorica
Multiple shift workforce lower bounds
Management Science
Convex separable optimization is not much harder than linear optimization
Journal of the ACM (JACM)
A faster strongly polynomial minimum cost flow algorithm
Operations Research
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Matchings in colored bipartite networks
Discrete Applied Mathematics
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
A faster algorithm for finding minimum tucker submatrices
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A polynomial-time algorithm for finding a minimal conflicting set containing a given row
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Operations Research Letters
The maximum clique problem in multiple interval graphs (extended abstract)
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
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 consecutive 1s, each corresponding to a shift. We focus on three types of shift scheduling problems classified according to the column structure in the constraint matrix: columns of consecutive 1s, columns of cyclical 1s, and columns of k consecutive blocks. In particular, the complexity of the cyclical scheduling problem, where the matrix satisfies the property of cyclical 1s in each column, was noted recently by Hochbaum and Tucker to be open. They further showed that the unit demand case is polynomially solvable. Here we extend this result to the uniform requirements case, and provide a 2-approximation algorithm for the non-uniform case. We also establish that the cyclical scheduling problem's complexity is equivalent to that of the exact matching problem-a problem the complexity status of which is known to be randomized polynomial (RP). We then investigate the three types of shift scheduling problems and show that, while the consecutive ones version is polynomial and the k-block columns version is NP-hard (for k=2), for the k-blocks problem we give a simple k-approximation algorithm, which is the first approximation algorithm determined for the problem.