Skip to main content
SpringerLink
Log in

Fixed-parameter tractability of capacitated k-facility location

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Xu X H, Du Z J, Chen X H, Cai C G. Confidence consensus-based model for large-scale group decision making: a novel approach to managing non-cooperative behaviors. Information Sciences, 2019, 477: 410–427

    Article  Google Scholar 

  2. Xu X, Dou W, Zhang X, Hu C, Chen J. A traffic hotline discovery method over cloud of things using big taxi GPS data. Software: Practice and Experience, 2017, 47(3): 361–377

    Google Scholar 

  3. Rong H, Zhang H, Xiao S, Li C, Hu C. Optimizing energy consumption for data centers. Renewable and Sustainable Energy Reviews, 2016, 58: 674–691

    Article  Google Scholar 

  4. Cohen-Addad V, Gupta A, Kumar A, Lee E, Li J. Tight FPT approximations for k-median and k-means. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. 2019, 42: 1–42: 14

  5. Aardal K, van den Berg P L, Gijswijt D, Li S. Approximation algorithms for hard capacitated k-facility location problems. European Journal of Operational Research, 2015, 242(2): 358–368

    Article  MathSciNet  MATH  Google Scholar 

  6. Han L, Xu D, Du D, Zhang D. A local search approximation algorithm for the uniform capacitated k-facility location problem. Journal of Combinatorial Optimization, 2018, 35(2): 409–423

    Article  MathSciNet  MATH  Google Scholar 

  7. Jiang Y, Xu D, Du D, Wu C, Zhang D. An approximation algorithm for soft capacitated k-facility location problem. Journal of Combinatorial Optimization, 2018, 35(2): 493–511

    Article  MathSciNet  MATH  Google Scholar 

  8. Byrka J, Fleszar K, Rybicki B, Spoerhase J. Bi-factor approximation algorithms for hard capacitated k-median problems. In: Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms. 2015, 722–736

  9. Adamczyk M, Byrka J, Marcinkowski J, Meesum S M, Wlodarczyk M. Constant-factor FPT approximation for capacitated k-Median. In: Proceedings of the 27th Annual European Symposium on Algorithms. 2019, 1: 1–1: 14

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. 62202161, 62172446), Open Project of Xiangjiang Laboratory (22XJ02002), Central South University Research Programme of Advanced Interdisciplinary Studies (2023QYJC023), Scientific Research Fund of Hunan Provincial Education Department (20C0538, 21A0376), and Project of Hunan Social Science Achievement Appraisal Committee (XSP21YBZ113). The authors are thankful to the reviewers for the valuable comments and suggestions, which are very helpful for improving this work.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Central South University, Changsha, 410000, China

    Xiangyan Kong

  2. School of Frontier Crossover Studies, Hunan University of Technology and Business, Changsha, 410205, China

    Zhen Zhang

  3. Changsha Social Laboratory of Artificial Intelligence, Changsha, 410205, China

    Zhen Zhang

Authors
  1. Xiangyan Kong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhen Zhang.

Electronic Supplementary Materia

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kong, X., Zhang, Z. Fixed-parameter tractability of capacitated k-facility location. Front. Comput. Sci. 17, 176408 (2023). https://doi.org/10.1007/s11704-023-2231-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-023-2231-9

Search

Navigation