{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:29:54Z","timestamp":1725809394761},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131221"},{"type":"electronic","value":"9783319131238"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13123-8_9","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T11:45:54Z","timestamp":1415965554000},"page":"108-119","source":"Crossref","is-referenced-by-count":1,"title":["Firefighting as a Game"],"prefix":"10.1007","author":[{"given":"Carme","family":"\u00c0lvarez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ipl.2009.12.009","volume":"110","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: A note on competitive diffusion through social networks. Information Processing Letters 110, 221\u2013225 (2010)","journal-title":"Information Processing Letters"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"\u00c0lvarez, C., Blesa, M., Molter, H.: Firefighting as a Game. Technical Report LSI-14-9-R, Computer Science Dept, Universitat Polit\u00e8cnica de Catalunya (2014)","DOI":"10.1007\/978-3-319-13123-8_9"},{"key":"9_CR3","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. Algorithmica 62, 520\u2013536 (2012)","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/j.jcss.2014.03.001","volume":"80","author":"C Bazgan","year":"2014","unstructured":"Bazgan, C., Chopin, M., Cygan, M., Fellows, M.R., Fomin, F., Jan van Leeuwen, E.: Parameterized complexity of firefighting. Journal of Computer and System Sciences 80, 1285\u20131297 (2014)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.dam.2012.11.011","volume":"161","author":"C Bazgan","year":"2013","unstructured":"Bazgan, C., Chopin, M., Ries, B.: The firefighter problem with more than one firefighter on trees. Discrete Applied Mathematics 161, 899\u2013908 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-92182-0_25","volume-title":"Algorithms and Computation","author":"L Cai","year":"2008","unstructured":"Cai, L., Verbin, E., Yang, L.: Firefighting on Trees: (1 \n                    \n                      \n                    \n                    $$-$$\n                   1\/e)\u2013Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 258\u2013269. Springer, Heidelberg (2008)"},{"key":"9_CR7","first-page":"162","volume":"20","author":"J Chleb\u00edkov\u00e1","year":"2013","unstructured":"Chleb\u00edkov\u00e1, J., Chopin, M.: The firefighter problem: A structural analysis. Electronic Colloquium on Computational Complexity 20, 162 (2013)","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"2410","DOI":"10.1016\/j.dam.2013.04.008","volume":"161","author":"V Costa","year":"2013","unstructured":"Costa, V., Dantas, S., Dourado, M.C., Penso, L., Rautenbach, D.: More fires and more fighters. Discrete Applied Mathematics 161, 2410\u20132419 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-28050-4_2","volume-title":"Parameterized and Exact Computation","author":"M Cygan","year":"2012","unstructured":"Cygan, M., Fomin, F.V., van Leeuwen, E.J.: Parameterized Complexity of Firefighting Revisited. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 13\u201326. Springer, Heidelberg (2012)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.dam.2012.08.005","volume":"161","author":"ON Feldheim","year":"2013","unstructured":"Feldheim, O.N., Hod, R.: 3\/2 Firefighters Are Not Enough. Discrete Applied Mathematics 161, 301\u2013306 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR11","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., MacGillivray, G., Rizzi, R.: The firefighter problem for graphs of maximum degree three. Discrete Mathematics 307, 2094\u20132105 (2007)","journal-title":"Discrete Mathematics"},{"key":"9_CR12","first-page":"57","volume":"43","author":"S Finbow","year":"2009","unstructured":"Finbow, S., MacGillivray, G.: The Firefighter Problem: A survey of results, directions and questions. Australian Journal of Combinatorics 43, 57\u201377 (2009)","journal-title":"Australian Journal of Combinatorics"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129054113400017","volume":"24","author":"P Floderus","year":"2013","unstructured":"Floderus, P., Lingas, A., Persson, M.: Towards more efficient infection and fire fighting. International Journal of Foundations of Computer Science 24, 3\u201314 (2013)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-30347-0_19","volume-title":"Fun with Algorithms","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Heggernes, P., van Leeuwen, E.J.: Making Life Easier for Firefighters. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 177\u2013188. Springer, Heidelberg (2012)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"9_CR16","unstructured":"Hartnell, B.: Firefighter! an application of domination. In: 25th Manitoba Conference on Combinatorial Mathematics and Computing, University of Manitoba in Winnipeg, Canada (1995)"},{"key":"9_CR17","first-page":"187","volume":"145","author":"B Hartnell","year":"2000","unstructured":"Hartnell, B., Li, Q.: Firefighting on trees: How bad is the greedy algorithm? Congressus Numerantium 145, 187\u2013192 (2000)","journal-title":"Congressus Numerantium"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Iwaikawa, Y., Kamiyama, N., Matsui, T.: Improved Approximation Algorithms for Firefighter Problem on Trees. IEICE Transactions 94-D, 196\u2013199 (2011)","DOI":"10.1587\/transinf.E94.D.196"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.disc.2009.05.007","volume":"310","author":"A King","year":"2010","unstructured":"King, A., MacGillivray, G.: The firefighter problem for cubic graphs. Discrete Mathematics 310, 614\u2013621 (2010)","journal-title":"Discrete Mathematics"},{"key":"9_CR20","first-page":"83","volume":"47","author":"G MacGillivray","year":"2003","unstructured":"MacGillivray, G., Wang, P.: On the firefighter problem. Journal of Combinatorial Mathematics and Combinatorial Computing 47, 83\u201396 (2003)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.dam.2007.08.011","volume":"156","author":"K Ng","year":"2008","unstructured":"Ng, K., Raff, P.: A generalization of the firefighter problem on Z \n                    \n                      \n                    \n                    $$\\times $$\n                   Z. Discrete Applied Mathematics 156, 730\u2013745 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2013.01.011","volume":"113","author":"L Small","year":"2013","unstructured":"Small, L., Mason, O.: Nash Equilibria for competitive information diffusion on trees. Information Processing Letters 113, 217\u2013219 (2013)","journal-title":"Information Processing Letters"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1016\/j.dam.2012.10.029","volume":"161","author":"L Small","year":"2013","unstructured":"Small, L., Mason, O.: Information diffusion on the iterated local transitivity model of online social networks. Discrete Applied Mathematics 161, 1338\u20131344 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2011.10.015","volume":"112","author":"R Takehara","year":"2012","unstructured":"Takehara, R., Hachimori, M., Shigeno, M.: A comment on pure-strategy Nash equilibria in competitive diffusion games. Information Processing Letters 112, 59\u201360 (2012)","journal-title":"Information Processing Letters"},{"key":"9_CR25","unstructured":"Zinoviev, D., Duong, V., Zhang, H.: A Game Theoretical Approach to Modeling Information Dissemination in Social Networks. CoRR, abs\/1006.5493 (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13123-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T18:30:10Z","timestamp":1559068210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13123-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131221","9783319131238"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13123-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}