{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:51:10Z","timestamp":1764557470738,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046927"},{"type":"electronic","value":"9783030046934"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04693-4_7","type":"book-chapter","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T05:03:12Z","timestamp":1543381392000},"page":"102-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exploring Sparse Graphs with Advice (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Hans-Joachim","family":"B\u00f6ckenhauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janosch","family":"Fuchs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. Inf. Comput. 176(1), 1\u201321 (2002)","journal-title":"Inf. Comput."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0029571","volume-title":"Online Algorithms","author":"P Berman","year":"1998","unstructured":"Berman, P.: On-line searching and navigation. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 232\u2013241. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029571"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A Blum","year":"1997","unstructured":"Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26(1), 110\u2013137 (1997)","journal-title":"SIAM J. Comput."},{"key":"7_CR5","unstructured":"B\u00f6ckenhauer, H.J., Fuchs, J., Unger, W.: The graph exploration problem with advice. CoRR abs\/1804.06675 (2018)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-10631-6_35","volume-title":"Algorithms and Computation","author":"H-J B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of online problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331\u2013340. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_35"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Brass, P., Vigan, I., Xu, N.: Improved analysis of a multirobot graph exploration strategy. In: 2014 13th International Conference on Control Automation Robotics & Vision (ICARCV), pp. 1906\u20131910. IEEE (2014)","DOI":"10.1109\/ICARCV.2014.7064607"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-16926-7_20","volume-title":"Graph Theoretic Concepts in Computer Science","author":"J Chalopin","year":"2010","unstructured":"Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network exploration by silent and oblivious robots. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 208\u2013219. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_20"},{"issue":"1\u20133","key":"7_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2007.05.011","volume":"385","author":"S Das","year":"2007","unstructured":"Das, S., Flocchini, P., Kutten, S., Nayak, A., Santoro, N.: Map construction of unknown graphs by multiple agents. Theor. Comput. Sci. 385(1\u20133), 34\u201348 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. J. Algorithms 51(1), 38\u201363 (2004)","journal-title":"J. Algorithms"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-31104-8_23","volume-title":"Structural Information and Communication Complexity","author":"S Dobrev","year":"2012","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Markou, E.: Online graph exploration with advice. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 267\u2013278. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31104-8_23"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-77566-9_21","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"S Dobrev","year":"2008","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: How much information about the future is needed? In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 247\u2013258. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77566-9_21"},{"issue":"24","key":"7_CR13","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online computation with advice. Theor. Comput. Sci. 412(24), 2642\u20132656 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11561071_4","volume-title":"Algorithms \u2013 ESA 2005","author":"R Fleischer","year":"2005","unstructured":"Fleischer, R., Trippen, G.: Exploring an unknown graph efficiently. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 11\u201322. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_4"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2015.11.017","volume":"655","author":"KT Foerster","year":"2016","unstructured":"Foerster, K.T., Wattenhofer, R.: Lower and upper competitive bounds for online directed graph exploration. Theor. Comput. Sci. 655, 15\u201329 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-24749-4_22","volume-title":"STACS 2004","author":"P Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Ilcinkas, D.: Digraphs exploration with little memory. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 246\u2013257. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_22"},{"issue":"11","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ic.2008.07.005","volume":"206","author":"P Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with advice. Inf. Comput. 206(11), 1276\u20131287 (2008)","journal-title":"Inf. Comput."},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Gorain, B., Pelc, A.: Deterministic graph exploration with advice. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, 10\u201314 July 2017, pp. 132:1\u2013132:14 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.132","DOI":"10.4230\/LIPIcs.ICALP.2017.132"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-15155-2_3","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Hromkovi\u010d","year":"2010","unstructured":"Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: Information complexity of online problems. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 24\u201336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_3"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-56939-1_65","volume-title":"Automata, Languages and Programming","author":"B Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: Constructing competitive tours from local information. In: Lingas, A., Karlsson, R., Carlsson, S. (eds.) ICALP 1993. LNCS, vol. 700, pp. 102\u2013113. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56939-1_65"},{"key":"7_CR21","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42749-2","volume-title":"An Introduction to Online Computation - Determinism, Randomization, Advice","author":"D Komm","year":"2016","unstructured":"Komm, D.: An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-42749-2"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-25258-2_23","volume-title":"Structural Information and Communication Complexity","author":"D Komm","year":"2015","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., Smula, J.: Treasure hunt with advice. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 328\u2013341. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_23"},{"key":"7_CR23","volume-title":"Artificial Intelligence and Mobile Robots: Case Studies of Successful Robot Systems","author":"D Kortenkamp","year":"1998","unstructured":"Kortenkamp, D., Bonasso, R.P., Murphy, R.: Artificial Intelligence and Mobile Robots: Case Studies of Successful Robot Systems. MIT Press, Cambridge (1998)"},{"key":"7_CR24","unstructured":"Kr\u00e1lovi\u010d, R.: Personal communication (2017)"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2012.06.034","volume":"463","author":"N Megow","year":"2012","unstructured":"Megow, N., Mehlhorn, K., Schweitzer, P.: Online graph exploration: new results on old and new algorithms. Theor. Comput. Sci. 463, 62\u201372 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-38233-8_29","volume-title":"Algorithms and Complexity","author":"S Seibert","year":"2013","unstructured":"Seibert, S., Sprock, A., Unger, W.: Advice complexity of the online coloring problem. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 345\u2013357. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38233-8_29"},{"issue":"4","key":"7_CR27","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/MRA.2004.1371614","volume":"11","author":"S Thrun","year":"2004","unstructured":"Thrun, S., et al.: Autonomous exploration and mapping of abandoned mines. IEEE Robot. Autom. Mag. 11(4), 79\u201391 (2004)","journal-title":"IEEE Robot. Autom. Mag."},{"key":"7_CR28","unstructured":"Thrun, S., et al.: Robotic mapping: a survey. In: Exploring Artificial Intelligence in the New Millennium, vol. 1, pp. 1\u201335 (2002)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04693-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:23:04Z","timestamp":1710249784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04693-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046927","9783030046934"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04693-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}