<p>My input is a n-dimensional binary matrix.</p>

<p>My goal is to find the set of Hyperrectangles that covers every '1' at least once and covers not a single '0', which has minimal cardinality (the least amount of Hyperrectangles). The Hyperrectangles may overlap.</p>

<p>Before defining each next Hyperrectangle, I'm allowed to permute the 'rows' (along one or more dimensions) of the matrix.</p>

<p>An approximation algorithm will do, as long as it is always correct.</p>

<p>Is this problem reducible to some well-researched problem?</p>

<ds.algorithms><matrices><covering-problems>
Minimal set of Hyperrectangles covering an n-dimensional binary matrix with row permutations
Lior Kogan
# Minimal set of Hyperrectangles covering an n-dimensional binary matrix with row permutations

(Asked by: username_0 on 2015-07-08)

My input is a n-dimensional binary matrix.

My goal is to find the set of Hyperrectangles that covers every '1' at least once and covers not a single '0', which has minimal cardinality (the least amount of Hyperrectangles). The Hyperrectangles may overlap.

Before defining each next Hyperrectangle, I'm allowed to permute the 'rows' (along one or more dimensions) of the matrix.

An approximation algorithm will do, as long as it is always correct.

Is this problem reducible to some well-researched problem?

**Tags:** ds.algorithms, matrices, covering-problems


---

## 0 answers

