Minimum Set Problem
The Minimum Set Problem is a combinatorial optimization problem in reserve design that seeks to identify the smallest subset of spatial units required to represent all conservation targets, distinguishing it from other reserve selection models by prioritizing minimal area coverage while ensuring complete representation of species or features.
105
Publications
5.1K
Citations
307
Authors
177
Institutions
Publications per year
2017–2026
25
Parents
105
Recent Results in Art Galleries
Thomas C. Shermer · Proceedings of the IEEE · 1992 · 333 citations
Recent results in art galleries (geometry)
Thomas C. Shermer · Proceedings of the IEEE · 1992 · 292 citations
Edward Minieka · SIAM Review · 1970 · 211 citations
1–5 of 105
307
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 307
177

Cornell University
Ithaca, United States
3 h-index
4 publications
228 citations
ETH Zurich
Zurich, Switzerland
2 h-index
4 publications
59 citations
Simon Fraser University
Burnaby, Canada
2 h-index
3 publications
572 citations

University of Waterloo
Waterloo, Canada
2 h-index
7 publications
207 citations

Chinese Academy of Sciences
Beijing, China
2 h-index
4 publications
146 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
162 citations
California Southern University
Chandler, United States
2 h-index
8 publications
648 citations
University of Oklahoma
Norman, United States
2 h-index
2 publications
162 citations
1–8 of 177
Repository · 2 publications · 28 citations
2
h-index
2 publications · 30 citations
2
h-index
2 publications · 96 citations
2
h-index
2 publications · 625 citations
2
h-index
2 publications · 40 citations
2
h-index
1–5