References
- Dantzig, G. (2016). Linear programming and extensions. Princeton, NJ: Princeton University Press.
- Fang, R., & Luo, W. (2016). On the approximability for the fault-tolerant facility placement problem with and without rejection. American Journal of Mathematical and Management Sciences, 35(4), 345–352.
- Garey, M. R., & Johnson, D. S. (1979). A guide to the theory of NP-completeness. New York: WH Freemann.
- Krysta, P., & Solis-Oba, R. (2001). Approximation algorithm for bounded facility location problems. Journal of Combinatorial Optimization, 5(2), 233–247.
- Rybicki, B., & Byrka, J. (2015). Improved approximation algorithm for fault-tolerant facility placement. In Approximation and Online Algorithm (WAOA’15) (pp. 59–70). New York: Springer International Publishing.
- Weng, K. (2013). Approximation algorithm for uniform bounded facility location problem. Journal of Combinatorial Optimization, 26(2), 284–291.
- Xu, S., & Shen, H. (2009). The fault-tolerant facility allocation problem. In: Proceedings of the 20th International Symposium on Algorithm and Computation (ISSAC’09), pp. 689–698.
- Yan, L., & Chrobak, M. (2011). Approximation algorithm for the fault-tolerant facility placement problem. Information Processing Letters, 111(11), 545–549.
- Yan, L., & Chrobak, M. (2015). LP-rounding algorithms for the fault-tolerant facility placement problem. Journal of Discrete Algorithm, 33, 93–114.