Skip to main content
Mathematica

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

3
  • $\begingroup$ I think this is a general solution, but it is way too expensive, computationally. I'm dealing with 500x500 arrays typically, with something like 15% of the elements zeros, so need a solution that will be faster. I was hoping that the Subsets[Range[l]] could be reduced to a small set, either through heuristics, or otherwise. $\endgroup$ Commented Feb 27, 2016 at 2:46
  • 1
    $\begingroup$ @tavr I believe, a start could be to partition the matrix into groups of a small number of rows and reduce each separately, then somehow find the optimal union of reductions. Can't say much more from mobile right now though $\endgroup$ Commented Feb 27, 2016 at 16:39
  • $\begingroup$ @LLlAMnYP See The Consecutive Ones Submatrix Problem for Sparse Matrices: link.springer.com/article/10.1007/s00453-007-0118-z for a formal description of the problem. So the question could say "Given a 500x500 matrix to efficiently find the biggest submatrix containing non-zero elements". $\endgroup$ Commented Feb 27, 2016 at 17:35