Efficient Online Learning for Dynamic k-Clustering

                Dimitris Fotakis 1 Georgios Piliouras 2 Stratis Skoulakis 2

              Abstract                 while k-center assumes p = ∞ (Lin & Vitter, 1992; Kumar
   We study dynamic clustering problems from the         et al., 2010; Alamdari & Shmoys, 2018).
   perspective of online learning. We consider          Today’s access on vast data (that may be frequently updated
   an online learning problem, called Dynamic k-         over t ...