Approximability and parameterized complexity of consecutive ones submatrix problems

Authors:
Michael Dom;Jiong Guo;Rolf Niedermeier
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 11
Cited 3

On the consecutive ones property

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
Some optimal inapproximability results

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A simple test for the consecutive ones property

Journal of Algorithms
A note on the consecutive ones submatrix problem

Information Processing Letters
PC trees and circular-ones arrangements

Theoretical Computer Science - Computing and combinatorics
A certifying algorithm for the consecutive-ones property

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Parameterized Complexity

Parameterized Complexity

Red-blue covering problems and the consecutive ones property

Journal of Discrete Algorithms
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of Computer and System Sciences
Hardness results on the gapped consecutive-ones property problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.