{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:15Z","timestamp":1725677595935},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_29","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"315-326","source":"Crossref","is-referenced-by-count":1,"title":["Online Exploration of All Vertices in a Simple Polygon"],"prefix":"10.1007","author":[{"given":"Yuya","family":"Higashikawa","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"29_CR1","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W. Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Management Science\u00a013(7), 492\u2013498 (1967)","journal-title":"Management Science"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-72951-8_5","volume-title":"Structural Information and Communication Complexity","author":"M. Dynia","year":"2007","unstructured":"Dynia, M., \u0141opusza\u0144ski, J., Schindelhauer, C.: Why Robots Need Maps. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 41\u201350. Springer, Heidelberg (2007)"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gsieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks\u00a048(3), 166\u2013177 (2006)","journal-title":"Networks"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J.\u00a0Comput.\u00a07, 178\u2013193 (1978)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cosrev.2010.05.001","volume":"4","author":"S.K. Ghosh","year":"2010","unstructured":"Ghosh, S.K., Klein, R.: Online algorithms for searching and exploration in the plane. Computer Science Review\u00a04(4), 189\u2013201 (2010)","journal-title":"Computer Science Review"},{"key":"29_CR6","unstructured":"Higashikawa, Y., Katoh, N., Langerman, S., Tanigawa, S.: Online Graph Exploration Algorithms for Cycles and Trees by Multiple Searchers. In: Proc. 3rd AAAC Annual Meeting (2010)"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1137\/S0097539799348670","volume":"31","author":"F. Hoffmann","year":"2002","unstructured":"Hoffmann, F., Icking, C., Klein, R., Kriegel, K.: The polygon exploration problem. SIAM J.\u00a0Comput.\u00a031(2), 577\u2013600 (2002)","journal-title":"SIAM J.\u00a0Comput."},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-22012-8_38","volume-title":"Automata, Languages and Programming","author":"N. Megow","year":"2011","unstructured":"Megow, N., Mehlhorn, K., Schweitzer, P.: Online Graph Exploration: New Results on Old and New Algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 478\u2013489. Springer, Heidelberg (2011)"},{"issue":"9","key":"29_CR9","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1587\/transinf.E92.D.1620","volume":"E92-D","author":"S. Miyazaki","year":"2009","unstructured":"Miyazaki, S., Morimoto, N., Okabe, Y.: The online graph exploration problem on restricted graphs. IEICE Trans.\u00a0Inf.\u00a0& Syst.\u00a0E92-D(9), 1620\u20131627 (2009)","journal-title":"IEICE Trans.\u00a0Inf.\u00a0& Syst."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(94)90155-4","volume":"130","author":"B. Kalyanasundaram","year":"1994","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: Constructing competitive tours from local information. Theoretical Computer Science\u00a0130, 125\u2013138 (1994)","journal-title":"Theoretical Computer Science"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0377-2217(83)90153-4","volume":"12","author":"S. Schaible","year":"1983","unstructured":"Schaible, S., Ibaraki, T.: Fractional programming. European Journal of Operational Research\u00a012, 325\u2013338 (1983)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:34:30Z","timestamp":1558312470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}