Approximability and parameterized complexity of consecutive ones submatrix problems

被引:0
作者
Dom, Michael [1 ]
Guo, Jiong [1 ]
Niedermeier, Rolf [1 ]
机构
[1] Univ Jena, Inst Informat, Ernst-Abbe-Platz 2, D-07743 Jena, Germany
来源
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS | 2007年 / 4484卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:680 / +
页数:2
相关论文
共 18 条