Sciweavers

Share
TAMC
2007
Springer

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

11 years 7 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, we achieve a problem kernelization based on simple data reduction rules and provide several search tree algorithms. Finally, we derive inapproximability results.
Michael Dom, Jiong Guo, Rolf Niedermeier
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where TAMC
Authors Michael Dom, Jiong Guo, Rolf Niedermeier
Comments (0)
books