K-center Problem

The k-Center Problem is a fundamental facility location problem in combinatorial optimization that seeks to determine the optimal placement of k center points within a metric space such that the maximum distance from any demand point to its nearest center is minimized.

136

Publications

6.2K

Citations

297

Authors

169

Institutions

Publications per year

2017–2026

38

Authors

297

  1. SK
    Samir Khuller

    University of Maryland, College Park, United States

    6 publications · 679 citations

    6

    h-index

  2. RK
    Ravishankar Krishnaswamy

    Carnegie Mellon University, United States

    6 publications · 212 citations

    6

    h-index

  3. MH
    MohammadTaghi Hajiaghayi

    University of Maryland, College Park, United States

    3 publications · 210 citations

    3

    h-index

  4. CM
    Cecilia M. Procopiuc

    AT&T (United States), United States

    3 publications · 364 citations

    3

    h-index

  5. VC
    Vincent Cohen-Addad

    Centre National de la Recherche Scientifique, France

    3 publications · 60 citations

    3

    h-index

1–5 of 297

Venues

  1. arXiv (Cornell University)

    Repository · 10 publications · 159 citations

    10

    h-index

  2. ACM Transactions on Algorithms

    TALG · 7 publications · 355 citations

    7

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 7 publications · 193 citations

    7

    h-index

  4. Theoretical Computer Science

    5 publications · 372 citations

    5

    h-index

  5. Algorithmica

    4 publications · 339 citations

    4

    h-index

1–5