Set Cover
Set Cover is a combinatorial optimization problem in which the goal is to select the minimum number of subsets from a given collection such that their union includes every element of a specified universal set.
850
Publications
53.7K
Citations
1.7K
Authors
717
Institutions
Publications per year
2017–2026
131
Parents
850
A threshold of ln <i>n</i> for approximating set cover
Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
The Location of Emergency Service Facilities
Constantine Toregas, Ralph W. Swain, Charles ReVelle et al. · Operations Research · 1971 · 1.8K citations
1–5 of 850
1.7K
11
h-index
Pontificia Universidad Católica de Valparaíso, Chile
10 publications · 337 citations
10
h-index
10
h-index
10
h-index
9
h-index
1–5 of 1.7K
717
Carnegie Mellon University
Pittsburgh, United States
17 h-index
30 publications
1.4K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
35 publications
2K citations
Technion – Israel Institute of Technology
Haifa, Israel
13 h-index
23 publications
1.2K citations
Georgia Institute of Technology
Atlanta, United States
12 h-index
18 publications
828 citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
27 publications
1.6K citations
AT&T (United States)
Bedminster, United States
11 h-index
15 publications
612 citations
University of California, Berkeley
Berkeley, United States
11 h-index
14 publications
1.9K citations
Northeast Normal University
Changchun, China
11 h-index
44 publications
942 citations
1–8 of 717
38 publications · 2.8K citations
25
h-index
24 publications · 3.3K citations
21
h-index
20 publications · 898 citations
17
h-index
17 publications · 931 citations
16
h-index
21 publications · 709 citations
16
h-index
1–5