Maximum Coverage
Maximum Coverage is a combinatorial optimization problem in the class of set-covering problems that specifically seeks to select a fixed number of sets from a collection in order to maximize the cardinality of the union of the selected sets.
523
Publications
27.6K
Citations
1.6K
Authors
661
Institutions
Publications per year
2017–2026
147
Parents
523
The budgeted maximum coverage problem
Samir Khuller, Anna Moss, Joseph Naor · Information Processing Letters · 1999 · 994 citations
Selection of representative protein data sets
Uwe Hobohm, Michael E. Scharf, Reinhard Schneider et al. · Protein Science · 1992 · 826 citations · Full text
1–5 of 523
1.6K
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 1.6K
661
University of California, Berkeley
Berkeley, United States
8 h-index
13 publications
774 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
11 publications
577 citations
Tsinghua University
Beijing, China
7 h-index
16 publications
754 citations
The University of Texas at Dallas
Richardson, United States
7 h-index
18 publications
1K citations

University of Alberta
Edmonton, Canada
6 h-index
8 publications
358 citations

Pennsylvania State University
State College, United States
6 h-index
14 publications
958 citations
University of Science and Technology of China
Hefei, China
6 h-index
20 publications
421 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
11 publications
544 citations
1–8 of 661
12 publications · 425 citations
12
h-index
10 publications · 248 citations
10
h-index
8 publications · 447 citations
8
h-index
7 publications · 315 citations
7
h-index
7 publications · 378 citations
7
h-index
1–5