Skip to main content
SpringerLink
Log in

Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems

  • Conference paper
  • First Online:
Frontiers of Algorithmic Wisdom (IJTCS-FAW 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13461))

Included in the following conference series:

  • 315 Accesses

Abstract

In this paper, we study the prize-collecting capacitated network design (PCCND) problem. We have to route the demand of each source to some sinks in a network, or eventually pay the prize to not serving the demand. We need to install multiple cables on the edges of the network to support the service. The goal is to find a feasible solution with the minimum cost. We give a 3.482-approximation algorithm for the PCCND. We also consider a special case of the PCCND, in which there is only one given sink, and present a 2.9672-approximation algorithm.

The research of the first author is supported by the National Natural Science Foundation of China (No. 12001523). The second author is supported by the national key research and development program of China under grant No. 2019YFB2102200, and by the Fundamental Research Funds for the Central Universities No. 2242022R10024.

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 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting steiner tree and tsp. SIAM J. Comput. 40(2), 309–332 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59(1), 413–420 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  3. Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, vol. 1, pp. 642–651 (2001)

    Google Scholar 

  4. Geunes, J., Levi, R., Romeijn, H.E., Shmoys, D.B.: Approximation algorithms for supply chain planning and logistics problems with market choice. Math. Program. 130(1), 85–106 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296–317 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hajiaghayi, M.T., Jain, K.: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. In: SODA, vol. 6, pp. 631–640. Citeseer (2006)

    Google Scholar 

  7. Hajiaghayi, M., Nasri, A.A.: Prize-Collecting Steiner Networks via Iterative Rounding. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 515–526. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12200-2_45

  8. Han, L., Xu, D., Du, D., Wu, C.: A 5-approximation algorithm for the k-prize-collecting steiner tree problem. Optim. Let. 13(3), 573–585 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  9. Han, L., Xu, D., Du, D., Zhang, D.: A local search approximation algorithm for the uniform capacitated k-facility location problem. J. Combin. Opt. 35(2), 409–423 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  10. Han, L., Xu, D., Li, M., Zhang, D.: Approximation algorithms for the robust facility leasing problem. Opt. Let. 12(3), 625–637 (2018). https://doi.org/10.1007/s11590-018-1238-x

    Article  MathSciNet  MATH  Google Scholar 

  11. Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear/submodular penalties. Algorithmica 73(2), 460–482 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mahdian, M., Pál, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 409–421. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39658-1_38

  13. Ravi, R., Sinha, A.: Approximation algorithms for problems combining facility location and network design. Oper. Res. 54(1), 73–81 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sharma, Y., Swamy, C., Williamson, D.P.: Approximation algorithms for prize collecting forest problems with submodular penalty functions. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1275–1284. Citeseer (2007)

    Google Scholar 

  15. Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245–269 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inform. Proces. Let. 94(3), 119–123 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalties. J. Combin. Opt. 17(4), 424–436 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Xu, Y., Xu, D., Du, D., Wu, C.: Improved approximation algorithm for universal facility location problem with linear penalties. Theor. Comput. Sci. 774, 143–151 (2019)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Beijing University of Posts and Telecommunications, Beijing, China

    Lu Han

  2. School of Computer Science and Engineering, Southeast University, Nanjing, China

    Vincent Chau

  3. Chu Hai College of Higher Education, Hong Kong, China

    Chi Kit Ken Fong

Authors
  1. Lu Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vincent Chau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chi Kit Ken Fong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent Chau .

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Hong Kong, China

    Minming Li

  2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Xiaoming Sun

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Han, L., Chau, V., Fong, C.K.K. (2022). Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems. In: Li, M., Sun, X. (eds) Frontiers of Algorithmic Wisdom. IJTCS-FAW 2022. Lecture Notes in Computer Science, vol 13461. Springer, Cham. https://doi.org/10.1007/978-3-031-20796-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20796-9_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20795-2

  • Online ISBN: 978-3-031-20796-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation