乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:12:37Z","timestamp":1725466357209},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_23","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"267-278","source":"Crossref","is-referenced-by-count":21,"title":["Online Graph Exploration with Advice"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Euripides","family":"Markou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ipl.2009.10.013","volume":"110","author":"Y. Asahiro","year":"2010","unstructured":"Asahiro, Y., Miyano, E., Miyazaki, S., Yoshimuta, T.: Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Information Processing Letters\u00a0110(3), 93\u201398 (2010)","journal-title":"Information Processing Letters"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-22006-7_18","volume-title":"Automata, Languages and Programming","author":"H.-J. B\u00f6ckenhauer","year":"2011","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the Advice Complexity of the k-Server Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 207\u2013218. Springer, Heidelberg (2011)"},{"key":"23_CR3","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.\u00a05878, pp. 331\u2013340. Springer, Heidelberg (2009)"},{"unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis, vol.\u00a02. Cambridge University Press (1998)","key":"23_CR4"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jpdc.2011.10.004","volume":"72","author":"D. Dereniowski","year":"2012","unstructured":"Dereniowski, D., Pelc, A.: Drawing maps with advice. J. Parallel Distrib. Comput.\u00a072(2), 132\u2013143 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"23_CR6","first-page":"585","volume":"43","author":"S. Dobrev","year":"2009","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: Measuring the problem-relevant information in input. ITA\u00a043(3), 585\u2013613 (2009)","journal-title":"ITA"},{"issue":"24","key":"23_CR7","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.\u00a0412(24), 2642\u20132656 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0304-3975(01)00395-4","volume":"291","author":"P. Flocchini","year":"2003","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Sense of direction in distributed computing. Theor. Comput. Sci.\u00a0291(1), 29\u201353 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"23_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00446-008-0076-y","volume":"21","author":"P. Fraigniaud","year":"2009","unstructured":"Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing\u00a021(6), 395\u2013403 (2009)","journal-title":"Distributed Computing"},{"issue":"12","key":"23_CR10","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.dam.2007.11.001","volume":"156","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Impact of memory size on graph exploration capability. Discrete Applied Mathematics\u00a0156(12), 2310\u20132319 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"3-4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jcss.2009.07.002","volume":"76","author":"P. Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Communication algorithms with advice. J. Comput. Syst. Sci.\u00a076(3-4), 222\u2013232 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/s00224-010-9280-9","volume":"47","author":"P. Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Korman, A., Lebhar, E.: Local mst computation with short advice. Theory Comput. Syst.\u00a047(4), 920\u2013933 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00453-009-9361-9","volume":"60","author":"E.G. Fusco","year":"2011","unstructured":"Fusco, E.G., Pelc, A.: Trade-offs between the size of advice and broadcasting time in trees. Algorithmica\u00a060(4), 719\u2013734 (2011)","journal-title":"Algorithmica"},{"key":"23_CR14","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, Heidelberg (2002)"},{"key":"23_CR15","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.\u00a06281, pp. 24\u201336. Springer, Heidelberg (2010)"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(03)00093-2","volume":"32","author":"C.A. Hurkens","year":"2004","unstructured":"Hurkens, C.A., Woeginger, G.J.: On the nearest neighbor rule for the traveling salesman problem. Operations Research Letters\u00a032(1), 1\u20134 (2004)","journal-title":"Operations Research Letters"},{"issue":"14-15","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1016\/j.tcs.2010.01.004","volume":"411","author":"D. Ilcinkas","year":"2010","unstructured":"Ilcinkas, D., Kowalski, D.R., Pelc, A.: Fast radio broadcasting with advice. Theor. Comput. Sci.\u00a0411(14-15), 1544\u20131557 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR18","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(1), 125\u2013138 (1994)","journal-title":"Theoretical Computer Science"},{"key":"23_CR19","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":"23_CR20","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1587\/transinf.E92.D.1620","volume":"92","author":"S. Miyazaki","year":"2009","unstructured":"Miyazaki, S., Morimoto, N., Okabe, Y.: The online graph exploration problem on restricted graphs. IEICE Transactions on Information and Systems\u00a092(9), 1620\u20131627 (2009)","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"3","key":"23_CR21","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D.J. Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput.\u00a06(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:44:57Z","timestamp":1620128697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}