{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:11:55Z","timestamp":1766063515453,"version":"3.48.0"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071126"],"award-info":[{"award-number":["12071126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.tcs.2025.115595","type":"journal-article","created":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T20:02:32Z","timestamp":1761076952000},"page":"115595","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Fault-tolerant priority facility location problem"],"prefix":"10.1016","volume":"1059","author":[{"given":"Yingying","family":"Guo","sequence":"first","affiliation":[]},{"given":"Runjie","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Qiaoliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2025.115595_bib0001","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0165-1765(83)90137-4","article-title":"Equilibrium store locations when consumers minimize travel time plus waiting time","volume":"11","author":"Kohlberg","year":"1983","journal-title":"Econ. Lett."},{"key":"10.1016\/j.tcs.2025.115595_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2021.01.016","article-title":"Multiple facility location games with envy ratio","volume":"864","author":"Liu","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115595_bib0003","series-title":"2017\u202fIEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21\u201326, 2017","first-page":"2206","article-title":"Deep metric learning via facility location","author":"Song","year":"2017"},{"key":"10.1016\/j.tcs.2025.115595_bib0004","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.cor.2016.05.018","article-title":"A survey of healthcare facility location","volume":"79","author":"Ahmadi-Javid","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.tcs.2025.115595_bib0005","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S0196-6774(03)00056-7","article-title":"A constant factor approximation algorithm for the fault-tolerant facility location problem","volume":"48","author":"Guha","year":"2003","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2025.115595_bib0006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1383369.1383382","article-title":"Fault-tolerant facility location","volume":"4","author":"Swamy","year":"2008","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"2","key":"10.1016\/j.tcs.2025.115595_bib0007","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s10878-024-01106-0","article-title":"Approximation algorithms for the fault-tolerant facility location problem with submodular penalties","volume":"47","author":"Guo","year":"2024","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2025.115595_bib0008","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.dam.2019.01.003","article-title":"Approximation algorithms for the fault-tolerant facility location problem with penalties","volume":"264","author":"Ji","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2025.115595_bib0009","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.tcs.2014.05.013","article-title":"Robust fault tolerant uncapacitated facility location","volume":"543","author":"Chechik","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115595_bib0010","series-title":"A constant factor approximation algorithm for fault-tolerant k-median","first-page":"1","volume":"12","author":"Hajiaghayi","year":"2016"},{"key":"10.1016\/j.tcs.2025.115595_bib0011","series-title":"Approximation and Online Algorithms","first-page":"188","article-title":"Fault tolerant clustering with outliers","volume":"11926","author":"Inamdar","year":"2020"},{"key":"10.1016\/j.tcs.2025.115595_bib0012","series-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11\u201314, 2004","first-page":"342","article-title":"Multicommodity facility location","author":"Ravi","year":"2004"},{"issue":"5","key":"10.1016\/j.tcs.2025.115595_bib0013","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1007\/s11424-014-2157-2","article-title":"Approximation algorithms for the priority facility location problem with penalties","volume":"28","author":"Wang","year":"2015","journal-title":"J. Syst. Sci. Complexity"},{"issue":"5","key":"10.1016\/j.tcs.2025.115595_bib0014","doi-asserted-by":"crossref","DOI":"10.1007\/s11432-020-3066-x","article-title":"An approximation algorithm for k-median with priorities","volume":"64","author":"Zhang","year":"2021","journal-title":"Sci. China Inf. Sci"},{"issue":"7","key":"10.1016\/j.tcs.2025.115595_bib0015","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1080\/02331934.2011.611511","article-title":"Approximation algorithms for the stochastic priority facility location problem","volume":"62","author":"Li","year":"2013","journal-title":"Optimization"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752500533X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752500533X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:09:10Z","timestamp":1766063350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752500533X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":15,"alternative-id":["S030439752500533X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115595","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fault-tolerant priority facility location problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115595","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115595"}}