Concepedia

Set Cover Approximation

Set Cover Approximation is a computational optimization method that belongs to the class of approximation algorithms, specifically distinguished by its use of greedy or LP-based techniques to efficiently compute a near-optimal collection of sets whose union covers a given ground set while minimizing the number of sets selected.

395

Publications

26.6K

Citations

764

Authors

373

Institutions

Publications per year

2017–2026

69

Parents

Publications

395

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

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

, , +16

Approximation Algorithms for Connected Dominating Sets

Suvajyoti Guha, Samir Khuller · Algorithmica · 1998 · 1.1K citations

, , +9

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

Topological approaches to covering rough sets

William Zhu · Information Sciences · 2006 · 629 citations

, , +14

Greedy strikes back: Improved Facility Location Algorithms

1998 · 526 citations

, , +16

1–5 of 395

Authors

764

  1. SK
    Samir Khuller

    University of Maryland, College Park, United States

    6 publications · 2.3K citations

    6

    h-index

  2. JZ
    Jianming Zhan

    Minzu University of China, China

    6 publications · 555 citations

    6

    h-index

  3. KV
    Kasturi Varadarajan

    University of Iowa, United States

    5 publications · 383 citations

    6

    h-index

  4. SH
    Sariel Har-Peled

    University of Illinois Urbana-Champaign, United States

    6 publications · 201 citations

    6

    h-index

  5. JL
    Jinjin Li

    Minnan Normal University, China

    5 publications · 167 citations

    5

    h-index

1–5 of 764

Institutions

373

  1. University of Maryland, College Park

    College Park, United States

    11 h-index

    17 publications

    2.9K citations

  2. University of California, Berkeley

    Berkeley, United States

    10 h-index

    12 publications

    1.5K citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    9 h-index

    21 publications

    859 citations

  4. Minnan Normal University

    Zhangzhou, China

    8 h-index

    19 publications

    1K citations

  5. Weizmann Institute of Science

    Rehovot, Israel

    8 h-index

    9 publications

    4.6K citations

  6. University of Waterloo

    Waterloo, Canada

    8 h-index

    19 publications

    1K citations

  7. University of Warsaw

    Warsaw, Poland

    7 h-index

    12 publications

    441 citations

  8. Technion – Israel Institute of Technology

    Haifa, Israel

    7 h-index

    9 publications

    349 citations

1–8 of 373

Venues

  1. Information Sciences

    25 publications · 2.7K citations

    21

    h-index

  2. Algorithmica

    15 publications · 2.3K citations

    15

    h-index

  3. Theoretical Computer Science

    18 publications · 527 citations

    14

    h-index

  4. Discrete Applied Mathematics

    13 publications · 505 citations

    13

    h-index

  5. International Journal of Approximate Reasoning

    11 publications · 541 citations

    11

    h-index

1–5