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

Authors

1.7K

  1. MY
    Minghao Yin

    Northeast Normal University, China

    11 publications · 271 citations

    11

    h-index

  2. BC
    Broderick Crawford

    Pontificia Universidad Católica de Valparaíso, Chile

    10 publications · 337 citations

    10

    h-index

  3. YW
    Yiyuan Wang

    Northeast Normal University, China

    10 publications · 222 citations

    10

    h-index

  4. RS
    Ricardo Soto

    Pontificia Universidad Católica de Valparaíso, Chile

    10 publications · 337 citations

    10

    h-index

  5. DS
    Dorit S. Hochbaum

    University of California, Berkeley, United States

    9 publications · 1.1K citations

    9

    h-index

1–5 of 1.7K

Venues

  1. European Journal of Operational Research

    38 publications · 2.8K citations

    25

    h-index

  2. Information Sciences

    24 publications · 3.3K citations

    21

    h-index

  3. Information Processing Letters

    20 publications · 898 citations

    17

    h-index

  4. Mathematical Programming

    17 publications · 931 citations

    16

    h-index

  5. Theoretical Computer Science

    21 publications · 709 citations

    16

    h-index

1–5