Fixed-parameter tractability of capacitated k-facility location

Graphical abstract

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

[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

[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

[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

[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

[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

[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

RIGHTS & PERMISSIONS

Higher Education Press