Balanced k-Center Clustering When k Is A Constant

The problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds. The problem is motivated by the applications in processing and analyzing large-scale data in high dimension. We provide a simple nearly linear time $4$-approximation algorithm when the number of clusters $k$ is assumed to be a constant. Comparing with existing method, our algorithm improves the approximation ratio and significantly reduces the time complexity. Moreover, our result can be easily extended to any metric space.

[1]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[2]  James B. Orlin,et al.  Max flows in O(nm) time, or better , 2013, STOC '13.

[3]  Chaitanya Swamy,et al.  Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers , 2016, ICALP.

[4]  Sariel Har-Peled,et al.  Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small , 2013, ArXiv.

[5]  Judit Bar-Ilan,et al.  How to Allocate Network Centers , 1993, J. Algorithms.

[6]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[7]  Aditya Bhaskara,et al.  Centrality of trees for capacitated k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-center , 2014, Mathematical Programming.

[8]  Aditya Bhaskara,et al.  Distributed Balanced Clustering via Mapping Coresets , 2014, NIPS.

[9]  Alexander J. Smola,et al.  Data Driven Resource Allocation for Distributed Learning , 2015, AISTATS.

[10]  Samir Khuller,et al.  LP Rounding for k-Centers with Non-uniform Hard Capacities , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[11]  Samir Khuller,et al.  The Capacitated K-Center Problem , 2000, SIAM J. Discret. Math..

[12]  Tomasz Kociumaka,et al.  Constant Factor Approximation for Capacitated k-Center with Outliers , 2014, STACS.

[13]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[14]  Vahab S. Mirrokni,et al.  Distributed Balanced Partitioning via Linear Embedding , 2015, WSDM.

[15]  Samir Khuller,et al.  Achieving anonymity via clustering , 2006, PODS '06.

[16]  Jian Li,et al.  Capacitated Center Problems with Two-Sided Bounds and Outliers , 2017, WADS.