The simultaneous consecutive ones problem

Authors:
Marcus Oswald;Gerhard Reinelt
Affiliations:
Institute of Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, D-69120 Heidelberg, Germany;Institute of Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, D-69120 Heidelberg, Germany
Venue:
Theoretical Computer Science
Year:
2009

Citing 3
Cited 2

PQ-tree algorithms.

PQ-tree algorithms.
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
The weighted consecutive ones problem for a fixed number of rows or columns

Operations Research Letters

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of Computer and System Sciences
A faster algorithm for finding minimum tucker submatrices

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe

Quantified Score

Hi-index	5.23

Visualization

Abstract

The standard consecutive ones problem is concerned with permuting the columns of a 0/1-matrix in such a way that in every row all 1-entries occur consecutively. In this paper we study this problem with the additional requirement that also in every column the 1-entries have to be consecutive. To achieve this column permutations have to be allowed as well. We show that the weighted simultaneous consecutive ones problem is NP-hard and consider two special cases with fixed row and column permutations where one is still NP-hard and the other one turns out to be easy.