5 citations · 22 across the 21 of their papers we have counts for
1 paper · 1 filter
Danny Z. Chen, Jian Li, Hongyu Liang +1
In the classic k-center problem, we are given a metric graph, and the objective is to open k nodes as centers such that the maximum distance from any vertex to its closest cent…