Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

DOI10.1007/978-3-540-72504-6_62zbMath1200.68282OpenAlexW1591762593MaRDI QIDQ5425481

Michael Dom, Rolf Niedermeier, Jiong Guo

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_62

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (4)

Hardness results on the gapped consecutive-ones property problem ⋮ Approximation and fixed-parameter algorithms for consecutive ones submatrix problems ⋮ Red-blue covering problems and the consecutive ones property ⋮ On the Gapped Consecutive-Ones Property

This page was built for publication: Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems