Sciweavers

Share
JCSS
2010

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

10 years 12 months ago
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard problem to delete a minimum number of rows or columns from a 0/1-matrix such that the remaining submatrix has the C1P. Key words: consecutive ones property, circular ones property, forbidden submatrix characterization, NP-hard problem, fixed-parameter tractability, exact algorithms
Michael Dom, Jiong Guo, Rolf Niedermeier
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JCSS
Authors Michael Dom, Jiong Guo, Rolf Niedermeier
Comments (0)
books