logo

SCIENCE CHINA Information Sciences, Volume 64 , Issue 5 : 150104(2021) https://doi.org/10.1007/s11432-020-3066-x

An approximation algorithm for $k$-median with priorities

More info
  • ReceivedApr 27, 2020
  • AcceptedAug 4, 2020
  • PublishedMar 31, 2021

Abstract

There is no abstract available for this article.


References

[1] Ravi R, Sinha A. Multicommodity facility location. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004. 342--349. Google Scholar

[2] Li G, Wang Z, Wu C. Approximation algorithms for the stochastic priority facility location problem. Optimization, 2013, 62: 919-928 CrossRef Google Scholar

[3] Wang F, Xu D, Wu C. Approximation algorithms for the priority facility location problem with penalties. J Syst Sci Complex, 2015, 28: 1102-1114 CrossRef Google Scholar

[4] Kumar A, Sabharwal Y. The priority $k$-median problem. In: Proceedings of the 27th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2007. 71--83. Google Scholar

[5] Shmoys D B, Swamy C, Levi R. Facility location with service installation costs. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004. 1088--1097. Google Scholar