集合覆盖问题（ Set covering problem，SCP）是组合数学、计算机科学和计算复杂性理论中的一个经典问题。
集合覆盖的决定性问题是卡普的二十一个NP-完全问题之一。
英语百科
Set cover problem 集合覆盖问题
（重定向自Set covering problem）
The set cover problem is a classical question in combinatorics, computer science and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972.
It is a problem "whose study has led to the development of fundamental techniques for the entire field" of approximation algorithms.