Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Computing k-center over Streaming Data for Small k

    The Euclidean k-center problem is to compute k congruent balls covering a given set of points in ℝ d such that the radius is minimized. We consider the k-center problem in ℝ ...

    Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son in Algorithms and Computation (2012)