The consecutive ones submatrix problem for sparse matrices

DOI10.1007/S00453-007-0118-ZMaRDI QIDQ2642313zbMATH OpenOpenAlexWikidataFDO

Authors Jinsong Tan, Louxin Zhang

Publication date 20 August 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-0118-z

Mathematics Subject Classification ID

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

Recommendations

• Algorithms and Computation
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
• scientific article; zbMATH DE number 3848609
• On Physical Mapping and the consecutive ones property for sparse matrices

Cited in

(16)

• Red-blue covering problems and the consecutive ones property
• Hardness results on the gapped consecutive-ones property problem
• A note on the consecutive ones submatrix problem.
• Obtaining matrices with the consecutive ones property by row deletions
• Minimising the number of gap-zeros in binary matrices
• The maximum matrix contraction problem
• Approximation of the Consecutive Ones Matrix Augmentation Problem
• A bad submatrix is easy to find
• Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
• Algorithms and Computation
• Consecutive ones matrices for multi-dimensional orthogonal packing problems
• Quantum graph drawing (best student paper)
• A faster algorithm for finding minimum Tucker submatrices
• Quantum graph drawing
• Finding nonoverlapping substructures of a sparse matrix
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

This page was built for publication: The consecutive ones submatrix problem for sparse matrices

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