Skip to main content

Questions tagged [combinatorics]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
7 votes
2 answers
677 views

Binary matrix column subset selection complexity

Given an $m \times n$ matrix ($m$ rows) containing only $0$'s and $1$'s, what is the complexity of finding an $m \times k$ submatrix (of $k$ columns) such that within the chosen submatrix there is no ...
antti.huima's user avatar
2 votes
1 answer
299 views

A non-trivial combinatorial optimization

So I stumble over this problem in which I couldn't find anything similar in the literature. I am not even sure if it is NP-hard or solvable in polynomial time. Any thought or suggestion would be ...
polar_bear_cheese's user avatar