集合被覆問題
1. Set cover problemThe set covering problem (SCP) is a classical question in computer science and complexity theory. It is a problem "whose study has led to the development of fundamental techniques for the entire field" of approximation algorithms. It was also one of Karp's 21 NP-complete problems shown to be NP-complete in 1972.
Read “Set cover problem” on English Wikipedia
Read “集合被覆問題” on Japanese Wikipedia
Read “Set cover problem” on DBpedia
Read “Set cover problem” on English Wikipedia
Read “集合被覆問題” on Japanese Wikipedia
Read “Set cover problem” on DBpedia
Discussions
Log in to talk about this word.