{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:22:53Z","timestamp":1773084173030,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280613","type":"print"},{"value":"9783540318064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_74","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"728-736","source":"Crossref","is-referenced-by-count":11,"title":["On the Power of Lookahead in On-Line Vehicle Routing Problems"],"prefix":"10.1007","author":[{"given":"Luca","family":"Allulli","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Ausiello","sequence":"additional","affiliation":[]},{"given":"Luigi","family":"Laura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"74_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/PL00009158","volume":"18","author":"S. Albers","year":"1997","unstructured":"Albers, S.: On the influence of lookahead in competitive paging algorithms. Algorithmica\u00a018(3), 283\u2013305 (1997)","journal-title":"Algorithmica"},{"issue":"1-2","key":"74_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0304-3975(97)00026-1","volume":"197","author":"S. Albers","year":"1998","unstructured":"Albers, S.: A competitive analysis of the list update problem with lookahead. Theor. Comput. Sci.\u00a0197(1-2), 95\u2013109 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"74_CR3","unstructured":"Allulli, L., Ausiello, G., Laura, L.: On the power of lookahead in on-line vehicle routing problems. TR-02-05, DIS, Universit\u00e0 di Roma \u201cLa Sapienza\u201d"},{"issue":"4","key":"74_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G. Ausiello","year":"2001","unstructured":"Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line travelling salesman. Algorithmica\u00a029(4), 560\u2013581 (2001)","journal-title":"Algorithmica"},{"key":"74_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/ijoc.13.2.138.10517","volume":"13","author":"M. Blom","year":"2001","unstructured":"Blom, M., Krumke, S.O., de Paepe, W.E., Stougie, L.: The online-TSP against fair adversaries. INFORMS Journal on Computing\u00a013, 138\u2013148 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"74_CR6","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"2","key":"74_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02124674","volume":"9","author":"F.R.K. Chung","year":"1989","unstructured":"Chung, F.R.K., Graham, R.L., Saks, M.E.: A dynamic location problem for graphs. Combinatorica\u00a09(2), 111\u2013131 (1989)","journal-title":"Combinatorica"},{"key":"74_CR8","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"74_CR9","first-page":"430","volume-title":"SODA 1995: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms","author":"E.F. Grove","year":"1995","unstructured":"Grove, E.F.: Online bin packing with lookahead. In: SODA 1995: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pp. 430\u2013436. SIAM, Philadelphia (1995)"},{"key":"74_CR10","volume-title":"The Traveling Salesman Problem and its Variations","year":"2002","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)"},{"issue":"1","key":"74_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01294263","volume":"11","author":"S. Irani","year":"1994","unstructured":"Irani, S.: Coloring inductive graphs on-line. Algorithmica\u00a011(1), 53\u201372 (1994)","journal-title":"Algorithmica"},{"key":"74_CR12","first-page":"214","volume-title":"FOCS 1995: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995)","author":"B. Kalyanasundaram","year":"1995","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance [scheduling problems]. In: FOCS 1995: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), p. 214. IEEE Computer Society, Los Alamitos (1995)"},{"key":"74_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45753-4_18","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"S.O. Krumke","year":"2002","unstructured":"Krumke, S.O., Laura, L., Lipmann, M., Marchetti-Spaccamela, A., de Paepe, W.E., Poensgen, D., Stougie, L.: Non-abusiveness helps: An \n                    \n                      \n                    \n                    \n$\\mathcal O(1)$\n\n                  -competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 200\u2013214. Springer, Heidelberg (2002)"},{"key":"74_CR14","unstructured":"M. Lipmann. On-Line Routing. PhD thesis, Technical University of Eindhoven, 2003."},{"key":"74_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/3-540-45749-6_59","volume-title":"Algorithms - ESA 2002","author":"M. Lipmann","year":"2002","unstructured":"Lipmann, M., Lu, X., de Paepe, W., Sitters, R., Stougie, L.: On-line dial-a-ride problems under a restricted information model. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 674\u2013685. Springer, Heidelberg (2002)"},{"issue":"3","key":"74_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/ijoc.10.3.331","volume":"10","author":"R. Motwani","year":"1998","unstructured":"Motwani, R., Saraswat, V., Torng, E.: Online scheduling with lookahead: Multipass assembly lines. INFORMS J. on Computing\u00a010(3), 331\u2013340 (1998)","journal-title":"INFORMS J. on Computing"},{"issue":"2","key":"74_CR17","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:19:54Z","timestamp":1553138394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11533719_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}