Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

DOI10.1007/978-3-540-72504-6_62MaRDI QIDQ5425481zbMATH OpenOpenAlexFDO

Authors Michael Dom, Jiong Guo, Rolf Niedermeier

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)

Recommendations

• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Algorithms and Computation
• The consecutive ones submatrix problem for sparse matrices
• FPT algorithms for consecutive ones submatrix problems
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results

Cited in

(9)

• Red-blue covering problems and the consecutive ones property
• Hardness results on the gapped consecutive-ones property problem
• The consecutive ones submatrix problem for sparse matrices
• On the gapped consecutive-ones property
• FPT algorithms for consecutive ones submatrix problems
• Approximation of the Consecutive Ones Matrix Augmentation Problem
• Algorithms and Computation
• Classical complexity and fixed-parameter tractability of simultaneous consecutive ones submatrix \& editing problems
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425481)