Cheap and Secure Web Hosting Provider : See Now

[Solved]: Set cover problem with constant size subset

, , No Comments
Problem Detail: 

Consider a variation of the set cover problem in which the size of the subsets is no larger than a constant $k$. Is this variation still NP-hard?

Asked By : Helium

Answered By : Hendrik Jan

The problem is NP-hard for $k\ge3$. It has a straightforward reduction from the 3-dimensional matching problem.

Best Answer from StackOverflow

Question Source :

3.2K people like this

 Download Related Notes/Documents


Post a Comment

Let us know your responses and feedback