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
Parents
136
Exact and Approximation Algorithms for Clustering
Pankaj K. Agarwal, Cecilia M. Procopiuc · Algorithmica · 2002 · 246 citations
Andrew Lim, Brian Rodrigues, Fan Wang et al. · Theoretical Computer Science · 2004 · 201 citations · Full text
The Capacitated <i>K</i>-Center Problem
Samir Khuller, Yoram J. Sussmann · SIAM Journal on Discrete Mathematics · 2000 · 178 citations
1–5 of 136
297
6
h-index
6
h-index
University of Maryland, College Park, United States
3 publications · 210 citations
3
h-index
3
h-index
Centre National de la Recherche Scientifique, France
3 publications · 60 citations
3
h-index
1–5 of 297
169
Carnegie Mellon University
Pittsburgh, United States
9 h-index
10 publications
393 citations
University of Maryland, College Park
College Park, United States
8 h-index
17 publications
1.6K citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
9 publications
452 citations

Utah State University
Logan, United States
5 h-index
7 publications
188 citations
University of California, Berkeley
Berkeley, United States
5 h-index
7 publications
2.1K citations
University of Pennsylvania
Philadelphia, United States
4 h-index
7 publications
234 citations
University of Science and Technology of China
Hefei, China
3 h-index
7 publications
154 citations
Duke University
Durham, United States
3 h-index
7 publications
752 citations
1–8 of 169
Repository · 10 publications · 159 citations
10
h-index
TALG · 7 publications · 355 citations
7
h-index
Repository · 7 publications · 193 citations
7
h-index
5 publications · 372 citations
5
h-index
4 publications · 339 citations
4
h-index
1–5