{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:29:47Z","timestamp":1649140187134},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2016edp7118","type":"journal-article","created":{"date-parts":[[2016,9,30]],"date-time":"2016-09-30T22:23:26Z","timestamp":1475274206000},"page":"2585-2590","source":"Crossref","is-referenced-by-count":2,"title":["Competitive Strategies for Evacuating from an Unknown Affected Area"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Qi","family":"WEI","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Dalian Maritime University"},{"name":"School of Information Science and Technology, Dalian Institute of Science and Technology"}]},{"given":"Xuehou","family":"TAN","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Tokai University"}]},{"given":"Bo","family":"JIANG","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Dalian Maritime University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Skutella, Research Trends in Combinatorial Optimization, ch. An Introduction to Network Flows over Time, pp.451-482, Springer Berlin Heidelberg, 2009.","DOI":"10.1007\/978-3-540-76796-1_21"},{"key":"2","unstructured":"[2] H.W. Hamacher and S.A. Tjandra, \u201cMathematical modelling of evacuation problems: A state of art,\u201d Tech. Rep. 24, Fraunhofer (ITWM), 2001."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] X. Chen and F.B. Zhan, \u201cAgent-based modelling and simulation of urban evacuation: Relative effectiveness of simultaneous and staged evacuation strategies,\u201d The Journal of the Operational Research Society, vol.59, no.1, pp.25-33, 2008.","DOI":"10.1057\/palgrave.jors.2602321"},{"key":"4","unstructured":"[4] Q. Lu, B. George, and S. Shekhar, \u201cCapacity constrained routing algorithms for evacuation planning: A summary of results,\u201d SSTD 2005, LNCS, vol.3633, pp.291-307, Springer Berlin Heidelberg, 2005."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] S. Shekhar, K. Yang, V.M.V. Gunturi, L. Manikonda, D. Oliver, X. Zhou, B. George, S. Kim, J.M.R. Wolff, and Q. Lu, \u201cExperiences with evacuation route planning algorithms,\u201d International Journal of Geographical Information Science, vol.26, no.12, pp.2253-2265, 2012.","DOI":"10.1080\/13658816.2012.719624"},{"key":"6","unstructured":"[6] M. Min and J. Lee, \u201cMaximum throughput flow-based contraflow evacuation routing algorithm,\u201d PERCOM Workshops 2013, IEEE International Conference on, San Diego, USA, pp.511-516, March 2013."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A. Gupta and N.L. Sarda, \u201cEfficient evacuation planning for large cities,\u201d DEXA 2014, LNCS, Munich, Germany, pp.211-225, Sept. 2014.","DOI":"10.1007\/978-3-319-10073-9_17"},{"key":"8","unstructured":"[8] Y. Xu and L. Qin, \u201cStrategies of groups evacuation from a convex region in the plane,\u201d FAW-AAIM 2013, LNCS, Dalian, China, vol.7924, pp.250-260, Springer Berlin Heidelberg, June 2013."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] D.D. Sleator and R.E. Tarjan, \u201cAmortized efficiency of list update and paging rules,\u201d Commun. ACM, vol.28, no.2, pp.202-208, Feb. 1985.","DOI":"10.1145\/2786.2793"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] N. Megow, K. Mehlhorn, and P. Schweitzer, \u201cOnline graph exploration: New results on old and new algorithms,\u201d Theoretical Computer Science, vol.463, pp.62-72, 2012.","DOI":"10.1016\/j.tcs.2012.06.034"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] H. Du and Y. Xu, \u201cAn approximation algorithm for k-center problem on a convex polygon,\u201d Journal of Combinatorial Optimization, vol.27, no.3, pp.504-518, 2014.","DOI":"10.1007\/s10878-012-9532-5"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] J. Czyzowicz, L. Gasieniec, K. Georgiou, E. Kranakis, and F. MacQuarrie, \u201cThe beachcombers' problem: Walking and searching with mobile robots,\u201d Theoretical Computer Science, vol.608, Part 3, pp.201-218, 2015.","DOI":"10.1016\/j.tcs.2015.09.011"},{"key":"13","unstructured":"[13] I.N. Bronstein, K.A. Semendjajew, and G. Musiol, Taschenbuch der Mathematik, 5th ed., Verlag Harry Deutsch, Frankfurt am Main, 2000."},{"key":"14","unstructured":"[14] S. Alpern and S. Gal, The Theory of Search Games and Rendezvous, Springer US, 2003."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/10\/E99.D_2016EDP7118\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T05:08:04Z","timestamp":1568437684000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/10\/E99.D_2016EDP7118\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":14,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7118","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}