Concepedia

Set Cover Problem

The Set Cover Problem is a combinatorial optimization problem in which the objective is to identify the smallest subcollection of a given family of sets whose union equals a specified universe of elements, distinguishing it from other covering problems by its focus on minimizing the number of sets while ensuring full coverage.

985

Publications

57.3K

Citations

1.9K

Authors

834

Institutions

Publications per year

2017–2026

143

Parents

Publications

985

A threshold of ln <i>n</i> for approximating set cover

Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text

, , +16

A Greedy Heuristic for the Set-Covering Problem

Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations

, , +17

A probabilistic heuristic for a computationally difficult set covering problem

Thomas A. Feo, Maurício G. C. Resende · Operations Research Letters · 1989 · 1K citations

, , +14

Reduction and axiomization of covering generalized rough sets

William Zhu, Fei‐Yue Wang · Information Sciences · 2003 · 701 citations

, , +8

On the hardness of approximating vertex cover

Irit Dinur, Samuel Safra · Annals of Mathematics · 2005 · 635 citations · Full text

, , +15

1–5 of 985

Authors

1.9K

  1. WZ
    William Zhu

    Minnan Normal University, China

    11 publications · 2.4K citations

    11

    h-index

  2. YW
    Yiyuan Wang

    Northeast Normal University, China

    10 publications · 222 citations

    10

    h-index

  3. BC
    Broderick Crawford

    Pontificia Universidad Católica de Valparaíso, Chile

    10 publications · 337 citations

    10

    h-index

  4. RS
    Ricardo Soto

    Pontificia Universidad Católica de Valparaíso, Chile

    10 publications · 337 citations

    10

    h-index

  5. MY
    Minghao Yin

    Northeast Normal University, China

    10 publications · 258 citations

    10

    h-index

1–5 of 1.9K

Institutions

834

  1. Carnegie Mellon University

    Pittsburgh, United States

    17 h-index

    39 publications

    1.7K citations

  2. Centre National de la Recherche Scientifique

    Paris, France

    16 h-index

    29 publications

    1.6K citations

  3. University of California, Berkeley

    Berkeley, United States

    15 h-index

    18 publications

    2K citations

  4. Technion – Israel Institute of Technology

    Haifa, Israel

    14 h-index

    28 publications

    1.6K citations

  5. Arizona State University

    Tempe, United States

    13 h-index

    28 publications

    2K citations

  6. Chinese Academy of Sciences

    Beijing, China

    13 h-index

    26 publications

    3.6K citations

  7. Tel Aviv University

    Tel Aviv, Israel

    13 h-index

    21 publications

    1.5K citations

  8. University of Waterloo

    Waterloo, Canada

    12 h-index

    24 publications

    1.4K citations

1–8 of 834

Venues

  1. European Journal of Operational Research

    35 publications · 2.7K citations

    24

    h-index

  2. Information Sciences

    25 publications · 3.5K citations

    21

    h-index

  3. Computers & Operations Research

    21 publications · 925 citations

    18

    h-index

  4. Theoretical Computer Science

    28 publications · 1.1K citations

    18

    h-index

  5. Information Processing Letters

    24 publications · 1.2K citations

    18

    h-index

1–5