FPT Algorithms for Consecutive Ones Submatrix Problems
A binary matrix M has the Consecutive Ones Property (COP) if there exists a permutation of columns that arranges the ones consecutively in all the rows. We consider the parameterized complexity of d-COS-R (Consecutive Ones Submatrix by Row deletions) problem : Given a matrix M and a positive integer d, decide whether there exists a set of at most d rows of M whose deletion results in a matrix with the COP. The closely related Interval Deletion problem has recently been shown to be FPT . In this work, we describe a recursive depth-bounded search tree algorithm in which the problems at the leaf-level of the recursion tree are solved as instances of Interval Deletion. Therefore, we show that d-COS-R is fixed-parameter tractable and has the current best run-time of O *(10 d ), which is associated with the Interval Deletion problem. We then consider a closely related optimization problem, called Min-ICPIA, and prove that it is computationally equivalent to the Vertex Cover problem.
KeywordsConsecutive Ones Property Consecutive Ones Submatrix Parameterized complexity
Unable to display preview. Download preview PDF.
- 3.Booth, K.S.: PQ-tree algorithms. Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, CA (1975)Google Scholar
- 5.Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. arXiv:1211.5933v2(cs.DS) (2013)Google Scholar
- 7.Dom, M.: Recognition, generation, and application of binary matrices with the consecutive-ones property. Ph.D. thesis, Institut fur Informatik, Friedrich-Schiller-Universitat (2008)Google Scholar
- 11.Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman (1979)Google Scholar
- 12.Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63 (1974)Google Scholar
- 14.Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 2nd edn. Annals of Discrete Mathematics, vol. 57. Elsevier B.V. (2004)Google Scholar
- 17.Hochbaum, D.S.: Approximation algorithms for NP-hard problems. PWS Publishing Company (1997)Google Scholar
- 21.McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 768–777 (2004)Google Scholar
- 24.Raffinot, M.: Consecutive ones property testing: cut or swap. In: Models of Computation in Context - 7th Conference on Computability in Europe, pp. 239–249 (2011)Google Scholar
- 29.West, D.B.: Introduction to graph theory, 2nd edn. Prentice Hall (2001)Google Scholar