Skip to main content
SpringerLink
Log in

A Local Search Approximation Algorithm for a Squared Metric k-Facility Location Problem

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10627))

  • 851 Accesses

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 (SMFLP) 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 chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Charikar, M., Guha, S., Tardos, É., Shmoys, D.B.: A constant-factor approximation algorithm for the \(k\)-median problem. In: Proceedings of STOC, pp. 1–10 (1999)

    Google Scholar 

  6. Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1–25 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fernandes, C.G., Meira, L.A., Miyazawa, F.K., Pedrosa, L.L.: 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 (2015)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Kanungoa, T., Mountb, D.M., Netanyahuc, N.S., Piatkoe, C.D., Silvermand, R., Wu, A.Y.: A local search approximation algorithm for \(k\)-means clustering. Comput. Geometry Theory Appl. 2, 89–112 (2004)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Li, S., Svensson, O.: Approximating \(k\)-median via pseudo-approximation. In: Proceedings of STOC, pp. 901–910 (2016)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of STOC, pp. 265–274 (1997)

    Google Scholar 

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

    Article  MATH  MathSciNet  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).

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. Department of Information and Operations Research, College of Applied Sciences, Beijing University of Technology, Beijing, 100124, People’s Republic of China

    Dachuan Xu, Yishui Wang & Zhenning Zhang

  3. 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 .

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  3. Kennesaw State University, Kennesaw, Georgia, USA

    Meng Han

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, D., Xu, D., Wang, Y., Zhang, P., Zhang, Z. (2017). A Local Search Approximation Algorithm for a Squared Metric k-Facility Location Problem. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10627. Springer, Cham. https://doi.org/10.1007/978-3-319-71150-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71150-8_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71149-2

  • Online ISBN: 978-3-319-71150-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation