The Non-Uniform k-Center Problem

Authors Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy

Thumbnail PDF


  • Filesize: 0.52 MB
  • 15 pages

Document Identifiers

Author Details

Deeparnab Chakrabarty
Prachi Goyal
Ravishankar Krishnaswamy

Cite AsGet BibTex

Deeparnab Chakrabarty, Prachi Goyal, and Ravishankar Krishnaswamy. The Non-Uniform k-Center Problem. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 67:1-67:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


In this paper, we introduce and study the Non-Uniform k-Center (NUkC) problem. Given a finite metric space (X, d) and a collection of balls of radii {r_1 >= ... >= r_k}, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation alpha, such that the union of balls of radius alpha*r_i around the i-th center covers all the points in X. This problem naturally arises as a min-max vehicle routing problem with fleets of different speeds, or as a wireless router placement problem with routers of different powers/ranges. The NUkC problem generalizes the classic k-center problem when all the k radii are the same (which can be assumed to be 1 after scaling). It also generalizes the k-center with outliers (kCwO for short) problem when there are k balls of radius 1 and l balls of radius 0. There are 2-approximation and 3-approximation algorithms known for these problems respectively; the former is best possible unless P=NP and the latter remains unimproved for 15 years. We first observe that no O(1)-approximation is to the optimal dilation is possible unless P=NP, implying that the NUkC problem is more non-trivial than the above two problems. Our main algorithmic result is an (O(1), O(1))-bi-criteria approximation result: we give an O(1)-approximation to the optimal dilation, however, we may open Theta(1) centers of each radii. Our techniques also allow us to prove a simple (uni-criteria), optimal 2-approximation to the kCwO problem improving upon the long-standing 3-factor. Our main technical contribution is a connection between the NUkC problem and the so-called firefighter problems on trees which have been studied recently in the TCS community. We show NUkC is as hard as the firefighter problem. While we don't know if the converse is true, we are able to adapt ideas from recent works [Chalermsook/Chuzhoy, SODA 2010; Asjiashvili/Baggio/Zenklusen, arXiv 2016] in non-trivial ways to obtain our constant factor bi-criteria approximation.
  • Clustering
  • k-Center
  • Approximation Algorithms
  • Firefighter Problem


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. D. Adjiashvili, A. Baggio, and R. Zenklusen. Firefighting on trees beyond integrality gaps. CoRR, abs/1601.00271, 2016. URL:
  2. J. Byrka, T. Pensyl, B. Rybicki, A. Srinivasan, and K. Trinh. An improved approximation for k-median, and positive correlation in budgeted optimization. Proceedings, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015. Google Scholar
  3. D. Chakrabarty, P. Goyal, and R. Krishnaswamy. The non-uniform k-center problem. Available on arXiv, and authors webpage (May, 2016), 2016. Google Scholar
  4. P. Chalermsook and J. Chuzhoy. Resource minimization for fire containment. Proceedings, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010. Google Scholar
  5. M. Charikar, L. O' Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. ACM Symp. on Theory of Computing (STOC), 2003. Google Scholar
  6. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic infomation retrieval. ACM Symp. on Theory of Computing (STOC), 1997. Google Scholar
  7. M. Charikar, S. Guha, D. Shmoys, and E. Tardos. A constant-factor approximation algorithm for the k-median problem. ACM Symp. on Theory of Computing (STOC), 1999. Google Scholar
  8. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. Proceedings, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001. Google Scholar
  9. S. Finbow, A. King, G. MacGillivray, and R. Rizzi. The firefighter problem for graphs of maximum degree three. Discrete Mathematics, 307(16):2094-2105, 2007. Google Scholar
  10. I. L. Goertz and V. Nagarajan. Locating depots for capacitated vehicle routing. Proceedings, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2011. Google Scholar
  11. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985. Google Scholar
  12. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. Proceedings of SIGMOD, 1998. Google Scholar
  13. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. ACM Symp. on Theory of Computing (STOC), 2004. Google Scholar
  14. D. S. Hochbaum and D. B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of operations research, 10(2):180-184, 1985. Google Scholar
  15. S. Im and B. Moseley. Fast and better distributed mapreduce algorithms for k-center clustering. Proceedings, ACM Symposium on Parallelism in Algorithms and Architectures, 2015. Google Scholar
  16. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM, 48(2):274-296, 2001. Google Scholar
  17. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. A local search approximation algorithm for k-means clustering. In Proceedings of the 18th Annual Symposium on Computational Geometry (SoCG'02), 2002. Google Scholar
  18. A. King and G. MacGillivray. The firefighter problem for cubic graphs. Discrete Mathematics, 310(3):614-621, 2010. Google Scholar
  19. A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1 + )-approximation algorithm for k-means clustering in any dimensions. Proceedings, IEEE Symposium on Foundations of Computer Science (FOCS), 2004. Google Scholar
  20. G. Laporte. Location routing problems. In B. L. Golden and A. A. Assad, editors, Vehicle Routing: Methods and Studies, pages 163-198. 1998. Google Scholar
  21. S. Li and O. Svensson. Approximating k-median via pseudo-approximation. ACM Symp. on Theory of Computing (STOC), 2013. Google Scholar
  22. G. Malkomes, M. J. Kusner, W. Chen, K. Q. Weinberger, and B. Moseley. Fast distributed k-center clustering with outliers on massive data. Advances in Neur. Inf. Proc. Sys. (NIPS), 2015. Google Scholar
  23. R. McCutchen and S. Khuller. Streaming algorithms for k-center clustering with outliers and with anonymity. Proceedings, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2008. Google Scholar
  24. H. Min, V. Jayaraman, and R. Srivastava. Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research, 108:1-15, 1998. Google Scholar