The Heterogeneous Capacitated k-Center Problem

  • Deeparnab Chakrabarty
  • Ravishankar Krishnaswamy
  • Amit KumarEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10328)


In this paper we initiate the study of the heterogeneous capacitated k -center problem: we are given a metric space \(X = (F \cup C, d)\), and a collection of capacities. The goal is to open each capacity at a unique facility location in F, and also to assign clients to facilities so that the number of clients assigned to any facility is at most the capacity installed; the objective is then to minimize the maximum distance between a client and its assigned facility. If all the capacities \(c_i\)’s are identical, the problem becomes the well-studied uniform capacitated k -center problem for which constant-factor approximations are known [7, 22]. The additional choice of determining which capacity should be installed in which location makes our problem considerably different from this problem and the non-uniform generalizations studied thus far in literature. In fact, one of our contributions is in relating the heterogeneous problem to special-cases of the classical santa-claus problem. Using this connection, and by designing new algorithms for these special cases, we get the following results for Heterogeneous Cap-\(k\)-Center.

  • A quasi-polynomial time \(O(\log n/\epsilon )\)-approximation where every capacity is violated by \((1+\epsilon )\) factor.

  • A polynomial time O(1)-approximation where every capacity is violated by an \(O(\log n)\) factor.

We get improved results for the soft-capacities version where we can place multiple facilities in the same location.


Facility Location Linear Programming Relaxation Cardinality Constraint Capacitate Facility Location Problem Center Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    An, H.-C., Bhaskara, A., Chekuri, C., Gupta, S., Madan, V., Svensson, O.: Centrality of trees for capacitated k-center. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 52–63. Springer, Cham (2014). doi: 10.1007/978-3-319-07557-0_5 CrossRefGoogle Scholar
  2. 2.
    An, H., Singh, M., Svensson, O.: Lp-based algorithms for capacitated facility location. In: 55th IEEE FOCS 2014, Philadelphia, PA, USA, 18–21 October 2014, pp. 256–265 (2014)Google Scholar
  3. 3.
    Asadpour, A., Feige, U., Saberi, A.: Santa claus meets hypergraph matchings. ACM Trans. Algorithms 8(3), 24 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Babel, L., Kellerer, H., Kotov, V.: Thek-partitioning problem. Math. Meth. OR 47(1), 59–82 (1998)CrossRefzbMATHGoogle Scholar
  5. 5.
    Bansal, M., Garg, N., Gupta, N.: A 5-approximation for capacitated facility location. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 133–144. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-33090-2_13 CrossRefGoogle Scholar
  6. 6.
    Bansal, N., Sviridenko, M.: The santa claus problem. In: Proceedings of the 38th Annual ACM STOC 2006, pp. 31–40 (2006)Google Scholar
  7. 7.
    Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15(3), 385–415 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the Eleventh Annual ACM-SIAM SODA, San Francisco, CA, USA, 9–11 January 2000, pp. 106–115 (2000)Google Scholar
  9. 9.
    Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of capacitated network design. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 78–91. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-20807-2_7 CrossRefGoogle Scholar
  10. 10.
    Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: 50th Annual IEEE FOCS 2009, Atlanta, Georgia, USA, 25–27 October 2009, pp. 107–116 (2009)Google Scholar
  11. 11.
    Chakrabarty, D., Goyal, P., Krishnaswamy, R.: The non-uniform k-center problem. In: 43rd ICALP 2016, pp. 67:1–67:15 (2016)Google Scholar
  12. 12.
    Chakrabarty, D., Krishnaswamy, R., Kumar, A.: The heterogeneous capacitated \(k\)-center problem. CoRR, abs/1611.07414 (2016)Google Scholar
  13. 13.
    Cygan, M., Hajiaghayi, M., Khuller, S.: LP rounding for k-centers with non-uniform hard capacities. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, 20–23 October 2012, pp. 273–282 (2012)Google Scholar
  14. 14.
    Demirci, H.G., Li, S.: Constant approximation for capacitated k-median with (1+epsilon)-capacity violation. In: 43rd ICALP 2016, pp. 73:1–73:14 (2016)Google Scholar
  15. 15.
    Feige, U.: On allocations that maximize fairness. In: Proceedings of the Nineteenth Annual ACM-SIAM SODA 2008, pp. 287–293 (2008)Google Scholar
  16. 16.
    Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25(2), 235–251 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Gørtz, I.L., Molinaro, M., Nagarajan, V., Ravi, R.: Capacitated vehicle routing with nonuniform speeds. Math. Oper. Res. 41(1), 318–331 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Guha, S., Rastogi, R., Shim, K.: Cure: an efficient clustering algorithm for large databases. Inf. Syst. 26(1), 35–58 (2001)CrossRefzbMATHGoogle Scholar
  19. 19.
    Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180–184 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Im, S., Moseley, B.: Scheduling in bandwidth constrained tree networks. In: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, 13–15 June 2015, pp. 171–180 (2015)Google Scholar
  21. 21.
    Kellerer, H., Kotov, V.: A 3/2-approximation algorithm for 3/2-partitioning. Oper. Res. Lett. 39(5), 359–362 (2011)MathSciNetzbMATHGoogle Scholar
  22. 22.
    Khuller, S., Sussmann, Y.J.: The capacitated K-center problem. SIAM J. Discrete Math. 13(3), 403–418 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Li, S.: On uniform capacitated k-median beyond the natural LP relaxation. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM SODA 2015, pp. 696–707 (2015)Google Scholar
  25. 25.
    Li, S.: Approximating capacitated \(k\)-median with (1 + \(\epsilon )k\) open facilities. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10–12 January 2016, pp. 786–796 (2016)Google Scholar
  26. 26.
    Lupton, R., Maley, F.M., Young, N.E.: Data collection for the sloan digital sky survey - a network-flow heuristic. J. Algorithms 27(2), 339–356 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Morgan, H.L., Levin, K.D.: Optimal program and data locations in computer networks. Commun. ACM 20(5), 315–322 (1977)CrossRefzbMATHGoogle Scholar
  28. 28.
    Murthy, K., Kam, J.B., Krishnamoorthy, M.S.: An approximation algorithm to the file allocation problem in computer networks. In: PODS (1983)Google Scholar
  29. 29.
    Polácek, L., Svensson, O.: Quasi-polynomial local search for restricted max-min fair allocation. ACM Trans. Algorithms 12(2), 13 (2016)MathSciNetzbMATHGoogle Scholar
  30. 30.
    Qiu, Z., Stein, C., Zhong, Y.: Minimizing the total weighted completion time of coflows in datacenter networks. In: Proceedings of the 27th ACM SPAA 2015, pp. 294–303 (2015)Google Scholar
  31. 31.
    Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: Innovations in Computer Science, ICS 2010, pp. 342–357 (2010)Google Scholar
  32. 32.
    Sen, G., Krishnamoorthy, M., Rangaraj, N., Narayanan, V.: Exact approaches for static data segment allocation problem in an information network. Comput. Oper. Res. 62, 282–295 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  33. 33.
    Shmoys, D.B., Tardos, É.: An approximation algorithm for the generalized assignment problem. Math. Program. 62, 461–474 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  34. 34.
    Woeginger, G.J.: A comment on scheduling two parallel machines with capacity constraints. Discrete Optim. 2, 269–272 (2005)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Deeparnab Chakrabarty
    • 1
  • Ravishankar Krishnaswamy
    • 2
  • Amit Kumar
    • 3
    Email author
  1. 1.Department of Computer ScienceDartmouth CollegeHanoverUSA
  2. 2.Microsoft Research IndiaBengaluruIndia
  3. 3.Department of Computer Science and EngineeringIIT DelhiNew DelhiIndia

Personalised recommendations