{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:06Z","timestamp":1740109326584,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s00453-022-00972-6","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T20:03:57Z","timestamp":1651608237000},"page":"2462-2479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment"],"prefix":"10.1007","volume":"84","author":[{"given":"Mirmahdi","family":"Rahgoshay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7650-2045","authenticated-orcid":false,"given":"Mohammad R.","family":"Salavatipour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,3]]},"reference":[{"issue":"2","key":"972_CR1","first-page":"201","volume":"15","author":"D Adjiashvili","year":"2019","unstructured":"Adjiashvili, D., Baggio, A., Zenklusen, R.: Firefighting on trees beyond integrality gaps. ACM Trans. Algorithms 15(2), 201\u20132033 (2019)","journal-title":"ACM Trans. Algorithms"},{"issue":"1\u20132","key":"972_CR2","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/s00453-010-9469-y","volume":"62","author":"E Anshelevich","year":"2012","unstructured":"Anshelevich, E., Chakrabarty, D., Hate, A., Swamy, C.: Approximability of the firefighter problem-computing cuts over time. Algorithmica 62(1\u20132), 520\u2013536 (2012)","journal-title":"Algorithmica"},{"key":"972_CR3","doi-asserted-by":"crossref","unstructured":"Cai, L., Verbin, E., Yang, L.: Firefighting on trees: (1-1\/e)-approximation, fixed parameter tractability and a subexponential algorithm. In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, 15\u201317 Dec 2008. Proceedings, Lecture Notes in Computer Science, vol. 5369, pp. 258\u2013269. Springer (2008)","DOI":"10.1007\/978-3-540-92182-0_25"},{"issue":"6","key":"972_CR4","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondrak, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"972_CR5","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Resource minimization for fire containment. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, 17\u201319 Jan 2010, pp. 1334\u20131349. SIAM (2010)","DOI":"10.1137\/1.9781611973075.108"},{"key":"972_CR6","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Vaz, D.: New integrality gap results for the firefighters problem on trees. In: Approximation and Online Algorithms\u201414th International Workshop, WAOA 2016, Aarhus, Denmark, 25\u201326 Aug 2016, Revised Selected Papers, Lecture Notes in Computer Science, vol. 10138, pp. 65\u201377. Springer (2016)","DOI":"10.1007\/978-3-319-51741-4_6"},{"issue":"16","key":"972_CR7","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.disc.2005.12.053","volume":"307","author":"S Finbow","year":"2007","unstructured":"Finbow, S., King, A.D., MacGillivray, G., Rizzi, R.: The firefighter problem for graphs of maximum degree three. Discret. Math. 307(16), 2094\u20132105 (2007)","journal-title":"Discret. Math."},{"key":"972_CR8","unstructured":"Hartnell, B., Li, Q.: Firefighting on trees: how bad is the greedy algorithm? In: Proceedings of Congressus Numerantium, pp. 187\u2013192 (2000)"},{"key":"972_CR9","unstructured":"Hartnell, B.L.: Firefighter! an application of domination. In: 24th Manitoba Conference on Combinatorial Mathematics and Computing (1995)"},{"issue":"2","key":"972_CR10","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1587\/transinf.E94.D.196","volume":"94D","author":"Y Iwaikawa","year":"2011","unstructured":"Iwaikawa, Y., Kamiyama, N., Matsui, T.: Improved approximation algorithms for firefighter problem on trees. IEICE Trans. Inf. Syst. 94D(2), 196\u2013199 (2011)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"3","key":"972_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.disc.2009.05.007","volume":"310","author":"AD King","year":"2010","unstructured":"King, A.D., MacGillivray, G.: The firefighter problem for cubic graphs. Discret. Math. 310(3), 614\u2013621 (2010)","journal-title":"Discret. Math."},{"key":"972_CR12","unstructured":"Lee, E.: Improved hardness for cut, interdiction, and firefighter problems. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10\u201314 July 2017, Warsaw, Poland. LIPIcs, vol. 80, pp. 92:1\u201392:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2017)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00972-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00972-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00972-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T14:14:21Z","timestamp":1660313661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00972-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,3]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["972"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00972-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,5,3]]},"assertion":[{"value":"28 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}