A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems

  • Soroush AlamdariEmail author
  • David Shmoys
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10787)


The k-center and k-median problems are two central clustering techniques that are well-studied and widely used. In this paper, we focus on possible simultaneous generalizations of these two problems and present a bicriteria approximation algorithm for them with constant approximation factor in both dimensions. We also extend our results to the so-called incremental setting, where cluster centers are chosen one by one and the resulting solution must have the property that the first k cluster centers selected must simultaneously be near-optimal for all values of k.


  1. 1.
    Aouad, A., Segev, D.: The ordered k-median problem: surrogate models and approximation algorithms. In submissionGoogle Scholar
  2. 2.
    Charikar, M., Guha, S., Tardos, É., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci. 65(1), 129–149 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293–306 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    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
  5. 5.
    Hsu, W., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discrete Appl. Math. 1(3), 209–215 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Li, S., Svensson, O.: Approximating k-median via pseudo-approximation. SIAM J. Comput. 45(2), 530–547 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Lin, G., Nagarajan, C., Rajaraman, R., Williamson, D.P.: A general approach for incremental approximation and hierarchical clustering. SIAM J. Comput. 39(8), 3633–3669 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Mettu, R.R., Plaxton, C.G.: The online median problem. SIAM J. Comput. 32(3), 816–832 (2003)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Cornell UniversityNew YorkUSA

Personalised recommendations