Results 1  10
of
3,799,739
Consecutive Ones Property
, 2000
"... A binary matrix has the Consecutive Ones Property(C1P) for columns if there is a permutation of its rows that leaves the 1's consecutive in every column. We study some results and algorithms about this problem and introduce some data structures such as PQtrees or its extension PQRtrees. We al ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A binary matrix has the Consecutive Ones Property(C1P) for columns if there is a permutation of its rows that leaves the 1's consecutive in every column. We study some results and algorithms about this problem and introduce some data structures such as PQtrees or its extension PQRtrees. We
On the Gapped Consecutive Ones Property
"... Abstract. Motivated by problems of comparative genomics and paleogenomics, we introduce the Gapped ConsecutiveOnes Property Problem (k,δ)C1P: given a binary matrix M and two integers k and δ, can the columns of M be permuted such that each row contains at most k sequences of 1’s and no two consecu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Motivated by problems of comparative genomics and paleogenomics, we introduce the Gapped ConsecutiveOnes Property Problem (k,δ)C1P: given a binary matrix M and two integers k and δ, can the columns of M be permuted such that each row contains at most k sequences of 1’s and no two
Algorithmic Aspects of the ConsecutiveOnes Property
, 2009
"... We survey the consecutiveones property of binary matrices. Herein, a binary matrix has the consecutiveones property (C1P) if there is a permutation of its columns that places the 1s consecutively in every row. We provide an overview over connections to graph theory, characterizations, recognition ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We survey the consecutiveones property of binary matrices. Herein, a binary matrix has the consecutiveones property (C1P) if there is a permutation of its columns that places the 1s consecutively in every row. We provide an overview over connections to graph theory, characterizations, recognition
A simple test for the consecutive ones property
 Journal of Algorithms
, 1992
"... A (0,1)matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueker [1976] designed a linear time testing algorithm for this property based on a data structure called "PQtrees&a ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
A (0,1)matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueker [1976] designed a linear time testing algorithm for this property based on a data structure called &
Minimum membership set covering and the consecutive ones property
 In Proc. 10th SWAT, volume 4059 of LNCS
, 2006
"... Abstract. The Minimum Membership Set Cover problem has recently been introduced and studied in the context of interference reduction in cellular networks. It has been proven to be notoriously hard in several aspects. Here, we investigate how natural generalizations and variations of this problem beh ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
behave in terms of the consecutive ones property: While it is wellknown that classical set covering problems become polynomialtime solvable when restricted to instances obeying the consecutive ones property, we experience a significantly more intricate complexity behavior in the case of Minimum
Tractability Results for the ConsecutiveOnes Property with Multiplicity
"... Abstract. A binary matrix has the ConsecutiveOnes Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1P where columns can appear multiple times in the ordering. Although the general problem of deciding the C1P with ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. A binary matrix has the ConsecutiveOnes Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1P where columns can appear multiple times in the ordering. Although the general problem of deciding the C1P
Set covering with almost consecutive ones property
 OF DISCRETE ALGORITHMS
, 2003
"... In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficie ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved
RedBlue Covering Problems and the Consecutive Ones Property
, 2007
"... Set Cover problems are of core importance in many applications. In recent research, the “redblue variants” where blue elements all need to be covered whereas red elements add further constraints on the optimality of a covering have received considerable interest. Application scenarios range from da ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
data mining to interference reduction in cellular networks. As a rule, these problem variants are computationally at least as hard as the original set cover problem. In this work we investigate whether and how the wellknown consecutive ones property, restricting the structure of the input sets, makes
Hardness Results for the Gapped ConsecutiveOnes Property Problem
, 2009
"... Motivated by problems of comparative genomics and paleogenomics, in [6] the authors introduced the Gapped ConsecutiveOnes Property Problem (k, δ)C1P: given a binary matrix M and two integers k and δ, can the columns of M be permuted such that each row contains at most k blocks of ones and no two ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Motivated by problems of comparative genomics and paleogenomics, in [6] the authors introduced the Gapped ConsecutiveOnes Property Problem (k, δ)C1P: given a binary matrix M and two integers k and δ, can the columns of M be permuted such that each row contains at most k blocks of ones and no two
Results 1  10
of
3,799,739