Skip to main content
Springer Nature Link
Log in

A local search approximation algorithm for a squared metric k-facility location problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper, we introduce a squared metric k-facility location problem (SM-k-FLP) which is a generalization of the squared metric facility location problem and k-facility location problem (k-FLP). In the SM-k-FLP, we are given a client set \(\mathcal {C}\) and a facility set \(\mathcal {F} \) from a metric space, a facility opening cost \(f_i \ge 0\) for each \( i \in \mathcal {F}\), and an integer k. The goal is to open a facility subset \(F \subseteq \mathcal {F}\) with \( |F| \le k\) and to connect each client to the nearest open facility such that the total cost (including facility opening cost and the sum of squares of distances) is minimized. Using local search and scaling techniques, we offer a constant approximation algorithm for the SM-k-FLP.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for \(k\)-median and facility location problems. SIAM J Comput 33:544–562

    Article  MathSciNet  MATH  Google Scholar 

  • Byrka J, Aardal KI (2010) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J Comput 39:2212–2231

    Article  MathSciNet  MATH  Google Scholar 

  • Byrka J, Pensyl T, Rybicki B, Srinivasan A (2014) An improved approximation for \(k\)-median, and positive correlation in budgeted optimization. In: Proceedings of SODA, pp 737–756

  • Charikar M, Guha S (2005) Improved combinatorial algorithms for facility location problems. SIAM J Comput 34:803–824

    Article  MathSciNet  MATH  Google Scholar 

  • Charikar M, Guha S, Tardos E, Shmoys DB (2002) A constant-factor approximation algorithm for the \(k\)-median problem. J Comput Syst Sci 1:129–149

    Article  MathSciNet  MATH  Google Scholar 

  • Chen X, Chen B (1999) Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica 53:263–297

    Article  MathSciNet  MATH  Google Scholar 

  • Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33:1–25

    Article  MathSciNet  MATH  Google Scholar 

  • Fernandes CG, Meira LA, Miyazawa FK, Pedrosa LL (2015) A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math Program 153:655–685

    Article  MathSciNet  MATH  Google Scholar 

  • Guha S, Khuller S (1999) Greedy strikes back: improved facility location Algorithms. J Algorithms 31:228–248

    Article  MathSciNet  MATH  Google Scholar 

  • Jain K, Mahdian M, Markakis E, Saberi A, Vazirani V (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM 50:795–824

    Article  MathSciNet  MATH  Google Scholar 

  • Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and \(k\)-median problems using the primal-dual schema and Lagrangian relaxation. J ACM 48:274–296

    Article  MathSciNet  MATH  Google Scholar 

  • Kanungo T, Mount DM, Netanyahu NS, Piatko CD, Silverman R, Wu AY (2004) A local search approximation algorithm for \(k\)-means clustering. Comput Geom Theory Appl 2:89–112

    Article  MathSciNet  MATH  Google Scholar 

  • Li S (2013) A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf Comput 222:45–58

    Article  MathSciNet  MATH  Google Scholar 

  • Li S, Svensson O (2016) Approximating \(k\)-median via pseudo-approximation. SIAM J Comput 45:530–547

    Article  MathSciNet  MATH  Google Scholar 

  • Mahdian M, Ye Y, Zhang J (2006) Approximation algorithms for metric facility location problems. SIAM J Comput 36:411–432

    Article  MathSciNet  MATH  Google Scholar 

  • Shmoys DB, Tardos E, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of SOTC, pp 265–274

  • Zhang J, Chen B, Ye Y (2005) A multiexchange local search algorithm for the capacitated facility location problem. Math Oper Res 30:389–403

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang P (2007) A new approximation algorithm for the \(k\)-facility location problem. Theor Comput Sci 384:126–135

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The research of the first author is supported by Higher Educational Science and Technology Program of Shandong Province (No. J15LN22). The second author is supported by Natural Science Foundation of China (No. 11531014). The fourth author is supported by Natural Science Foundation of China (No. 61672323) and Natural Science Foundation of Shandong Province (ZR2016AM28). The fifth author is supported by Beijing Excellent Talents Funding (No. 2014000020124G046). A preliminary version of the paper appeared in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications, Shanghai, China, 2017.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong Jianzhu University, Jinan, 250101, People’s Republic of China

    Dongmei Zhang

  2. Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing, 100124, People’s Republic of China

    Dachuan Xu

  3. Department of Information and Operations Research, College of Applied Sciences, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing, 100124, People’s Republic of China

    Yishui Wang & Zhenning Zhang

  4. School of Computer Science and Technology, Shandong University, Jinan, 250101, People’s Republic of China

    Peng Zhang

Authors
  1. Dongmei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dachuan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yishui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zhenning Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dachuan Xu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, D., Xu, D., Wang, Y. et al. A local search approximation algorithm for a squared metric k-facility location problem. J Comb Optim 35, 1168–1184 (2018). https://doi.org/10.1007/s10878-018-0261-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0261-2

Keywords