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

Authors

1.6K

  1. WW
    Weili Wu

    The University of Texas at Dallas, United States

    4 publications · 165 citations

    4

    h-index

  2. ZL
    Zaixin Lu

    The University of Texas at Dallas, United States

    4 publications · 148 citations

    4

    h-index

  3. DD
    Ding‐Zhu Du

    The University of Texas at Dallas, United States

    3 publications · 77 citations

    3

    h-index

  4. HS
    Hadas Shachnai

    Technion – Israel Institute of Technology, Israel

    3 publications · 335 citations

    3

    h-index

  5. RW
    Ruey-Sing Wei

    University of California, Berkeley, United States

    3 publications · 89 citations

    3

    h-index

1–5 of 1.6K

Venues

  1. Sensors

    12 publications · 425 citations

    12

    h-index

  2. IEEE Access

    10 publications · 248 citations

    10

    h-index

  3. The Journal of Chemical Physics

    8 publications · 447 citations

    8

    h-index

  4. Langmuir

    7 publications · 315 citations

    7

    h-index

  5. Computers & Operations Research

    7 publications · 378 citations

    7

    h-index

1–5