Covering Problems

Covering Problems is a class of geometric optimization problems that seek to determine the minimal number of geometric shapes or structures required to entirely cover a given set of points or a region in space, distinguished from other optimization problems by their focus on minimality and complete containment within geometric constraints.

1.2K

Publications

69.1K

Citations

2.1K

Authors

906

Institutions

Publications per year

2017–2026

123

Variants

Covering Problem

Authors

2.1K

  1. CJ
    Charles J. Colbourn

    Arizona State University, United States

    13 publications · 836 citations

    11

    h-index

  2. JT
    José Torres-Jiménez

    Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico

    10 publications · 272 citations

    10

    h-index

  3. ZD
    Zvi Drezner

    California State University, Fullerton, United States

    9 publications · 574 citations

    9

    h-index

  4. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    9 publications · 477 citations

    9

    h-index

  5. ZZ
    Zhao Zhang

    Zhejiang Normal University, China

    8 publications · 159 citations

    8

    h-index

1–5 of 2.1K

Venues

  1. Computers & Operations Research

    30 publications · 1.5K citations

    23

    h-index

  2. Information Sciences

    26 publications · 1.8K citations

    21

    h-index

  3. Discrete Applied Mathematics

    34 publications · 1.4K citations

    21

    h-index

  4. European Journal of Operational Research

    30 publications · 2.3K citations

    21

    h-index

  5. Information Processing Letters

    29 publications · 2.2K citations

    21

    h-index

1–5