Advanced search
Publication Cover
American Journal of Mathematical and Management Sciences Volume 38, 2019 - Issue 3
Submit an article Journal homepage
72
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

On the Bounded Fault-Tolerant Facility Placement Problem

Qiaoqiao ZhuFaculty of Science, Ningbo University, Ningbo, PR ChinaView further author information
,
Yizhe ZhuFaculty of Science, Ningbo University, Ningbo, PR ChinaView further author information
,
Jun YangFaculty of Science, Ningbo University, Ningbo, PR ChinaView further author information
&
Wenchang LuoFaculty of Science, Ningbo University, Ningbo, PR ChinaCorrespondence[email protected]
ORCID Iconhttp://orcid.org/0000-0002-0335-3253View further author information
ORCID Icon
Pages 241-249 | Received 28 Aug 2017, Accepted 13 Aug 2018, Published online: 13 Nov 2018

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.