Sciweavers

JCSS
2010
155views more  JCSS 2010»
13 years 10 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 ...
Michael Dom, Jiong Guo, Rolf Niedermeier
CIE
2010
Springer
14 years 2 months ago
A Faster Algorithm for Finding Minimum Tucker Submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are centr...
Guillaume Blin, Romeo Rizzi, Stéphane Viale...
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
14 years 3 months ago
A Simple Test for the Consecutive Ones Property
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 Lueke...
Wen-Lian Hsu
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 4 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
TAMC
2007
Springer
14 years 5 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier