Skip to main content

Approximation Algorithm for the Squared Metric Soft Capacitated Facility Location Problem (Extended Abstract)

  • Conference paper
  • First Online:
Computational Data and Social Networks (CSoNet 2019)

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

Included in the following conference series:

  • 997 Accesses

Abstract

We consider the squared metric soft capacitated facility location problem (SMSCFLP), which includes both the squared metric facility location problem (SMFLP) and the soft capacitated facility location problem (SCFLP) as special cases. As our main contribution, we propose a primal-dual based 10-approximation algorithm for the SMSCFLP. Our work also extends the applicability of the primal-dual technique.

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

Access this chapter

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  MathSciNet  Google Scholar 

  2. Fernandes, C.G., Meira, L.A.A., Miyazawa, F.K., Pedrosa, L.L.C.: 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  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. 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  MathSciNet  Google Scholar 

  5. Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229–242. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45753-4_20

    Chapter  MATH  Google Scholar 

  6. Stollsteimer, J.F.: A working model for plant numbers and locations. J. Farm Econ. 45, 631–645 (1963)

    Article  Google Scholar 

  7. Teo, C.P., Shu, J.: Warehouse-retailer network design problem. Oper. Res. 52, 396–408 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The second author is supported by Natural Science Foundation of China (No. 11531014). The third author is supported by Natural Science Foundation of China grant (No. 11901558) and China Postdoctoral Science Foundation funded project (No. 2018M643233). The fourth author is supported by Natural Science Foundation of China (No. 11871081).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dongmei Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Han, L., Xu, D., Xu, Y., Zhang, D. (2019). Approximation Algorithm for the Squared Metric Soft Capacitated Facility Location Problem (Extended Abstract). In: Tagarelli, A., Tong, H. (eds) Computational Data and Social Networks. CSoNet 2019. Lecture Notes in Computer Science(), vol 11917. Springer, Cham. https://doi.org/10.1007/978-3-030-34980-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34980-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34979-0

  • Online ISBN: 978-3-030-34980-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics