Set cover problem with sets of size 2

cs.stackexchange https://cs.stackexchange.com/questions/77575

  •  04-11-2019
  •  | 
  •  

문제

I have a question about the Set Cover problem: If I get a universe $U$, and $m$ subsets of size exactly $2$, and an integer $k$. Is this problem is still NP-C or I can solve it on a polynomial time?

Thanks.

올바른 솔루션이 없습니다

라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 cs.stackexchange
scroll top