set cover problem
classical problem in combinatorics
Facts
3 properties- Instance of
- computational problem
- Computational complexity
- NP-complete[3]
🏷️ Also known as
en set covering
en set cover problem
de Mengenüberdeckungsproblem
es problema del conjunto de cobertura
es problema de la cobertura de conjuntos
fa پوشش مجموعه
fr problème de couverture par ensembles
he בעיית כיסוי קבוצות
hu halmazfedési probléma
hu halmazfedés
ja 集合被覆問題
ko 집합 덮개
ko 집합 덮개 문제
nl verzamelingenoverdekking
pt Problema do conjunto-capa
ru Задача о покрытии множества
th ปัญหาการปกคลุมเซต
uk задача про покриття множини
zh 集合覆盖问题
🔖 Identifiers · 4
- OpenAlex ID
- C100808899
- Freebase ID
- /m/03k6tg
- Microsoft Academic ID (discontinued)
- 100808899
- Stack Exchange tag
- or.stackexchange.com
🔗 Connections
Belongs to 1
Computational complexity 1
Instance of 1
Part of 1
Press Enter · cited answer in seconds
0 sources
Summary
set cover problem is a computational problem[1].