FPT algorithms for consecutive ones submatrix problems

DOI10.1007/978-3-319-03898-8_25zbMATH Open1309.68099OpenAlexW258974901MaRDI QIDQ2867091FDOQ2867091

Authors: N. S. Narayanaswamy, R. Subashini 

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_25

Recommendations

• Obtaining matrices with the consecutive ones property by row deletions
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
• Classical complexity and fixed-parameter tractability of simultaneous consecutive ones submatrix \& editing problems
• Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

zbMATH Keywords

parameterized complexityconsecutive ones propertyconsecutive ones submatrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Cited In (6)

• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Obtaining matrices with the consecutive ones property by row deletions
• Classical complexity and fixed-parameter tractability of simultaneous consecutive ones submatrix \& editing problems
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
• A Spectral Algorithm for Seriation and the Consecutive Ones Problem
• Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

This page was built for publication: FPT algorithms for consecutive ones submatrix problems

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