{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:48Z","timestamp":1725795888720},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_59","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"713-725","source":"Crossref","is-referenced-by-count":6,"title":["Distance Oracles for Time-Dependent Networks"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Kontogiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R.: The space-stretch-time trade-off in distance oracles (July 2013) (manuscript)","DOI":"10.1007\/978-3-662-44777-2_5"},{"key":"59_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Godfrey, P.: Distance oracles for stretch less than 2. In: Proceedings of the 24th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 526\u2013538. ACM-SIAM (2013)","DOI":"10.1137\/1.9781611973105.38"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum time-dependent travel times with contraction hierarchies. ACM Journal of Experimental Algorithmics\u00a018 (2013)","DOI":"10.1145\/2444016.2444020"},{"issue":"3","key":"59_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K. Cooke","year":"1966","unstructured":"Cooke, K., Halsey, E.: The shortest route through a network with time-dependent intermodal transit times. Journal of Mathematical Analysis and Applications\u00a014(3), 493\u2013498 (1966)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"59_CR5","unstructured":"Dean, B.C.: Continuous-time dynamic shortest path algorithms. Master\u2019s thesis, Massachusetts Institute of Technology (1999)"},{"issue":"1","key":"59_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/net.20013","volume":"44","author":"B.C. Dean","year":"2004","unstructured":"Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks\u00a044(1), 41\u201346 (2004)","journal-title":"Networks"},{"key":"59_CR7","unstructured":"Dean, B.C.: Shortest paths in fifo time-dependent networks: Theory and algorithms. Technical report, MIT (2004)"},{"issue":"1-2","key":"59_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00453-010-9461-6","volume":"62","author":"F. Dehne","year":"2012","unstructured":"Dehne, F., Masoud, O.T., Sack, J.-R.: Shortest paths in time-dependent fifo networks. Algorithmica\u00a062(1-2), 416\u2013435 (2012)","journal-title":"Algorithmica"},{"key":"#cr-split#-59_CR9.1","doi-asserted-by":"crossref","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica\u00a060(1), 60-94 (2011)","DOI":"10.1007\/s00453-009-9341-0"},{"key":"#cr-split#-59_CR9.2","unstructured":"Special Issue: European Symposium on Algorithms (2008)"},{"key":"59_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D. Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-Dependent Route Planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"issue":"3","key":"59_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research\u00a017(3), 395\u2013412 (1969)","journal-title":"Operations Research"},{"key":"59_CR12","unstructured":"eCOMPASS Project (2011-2014), \n                    \n                      http:\/\/www.ecompass-project.eu"},{"key":"#cr-split#-59_CR13.1","doi-asserted-by":"crossref","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. Algorithmica\u00a068(4), 1075-1097 (2011)","DOI":"10.1007\/s00453-012-9714-7"},{"key":"#cr-split#-59_CR13.2","unstructured":"Preliminary version in ACM-SIAM SODA (2011)"},{"key":"59_CR14","unstructured":"Kontogiannis, S., Zaroliagis, C.: Distance oracles for time dependent networks. eCOMPASS Technical Report (eCOMPASS-TR-025) \/ ArXiv Report (arXiv.org > cs > arXiv:1309.4973) (September 2013)"},{"key":"59_CR15","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1002\/net.20438","volume":"59","author":"G. Nannicini","year":"2012","unstructured":"Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search on Time-Dependent Road Networks. Networks\u00a059, 240\u2013251 (2012)","journal-title":"Networks"},{"issue":"3","key":"59_CR16","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. Journal of the ACM\u00a037(3), 607\u2013625 (1990)","journal-title":"Journal of the ACM"},{"key":"59_CR17","doi-asserted-by":"crossref","unstructured":"Patrascu, M., Roditty, L.: Distance oracles beyond the Thorup\u2013Zwick bound. In: Proc. of 51th IEEE Symp. on Found. of Comp. Sci. (FOCS 2010), pp. 815\u2013823 (2010)","DOI":"10.1109\/FOCS.2010.83"},{"key":"59_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-642-23719-5_51","volume-title":"Algorithms \u2013 ESA 2011","author":"E. Porat","year":"2011","unstructured":"Porat, E., Roditty, L.: Preprocess, set, query! In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 603\u2013614. Springer, Heidelberg (2011)"},{"issue":"4","key":"59_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<259::AID-NET6>3.0.CO;2-C","volume":"31","author":"H.D. Sherali","year":"1998","unstructured":"Sherali, H.D., Ozbay, K., Subramanian, S.: The time-dependent shortest pair of disjoint paths problem: Complexity, Models, and Algorithms. Networks\u00a031(4), 259\u2013272 (1998)","journal-title":"Networks"},{"key":"59_CR20","doi-asserted-by":"crossref","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Computing Surveys\u00a046 (2014)","DOI":"10.1145\/2530531"},{"key":"59_CR21","doi-asserted-by":"crossref","unstructured":"Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: Proc. of 50th IEEE Symp. on Found. of Comp. Sci. (FOCS 2009), pp. 703\u2013712 (2009)","DOI":"10.1109\/FOCS.2009.27"},{"key":"59_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. of ACM\u00a052, 1\u201324 (2005)","journal-title":"J. of ACM"},{"key":"59_CR23","doi-asserted-by":"crossref","unstructured":"Wulff-Nilsen, C.: Approximate distance oracles with improved preprocessing time. In: Proc. of 23rd ACM-SIAM Symp. on Discr. Alg. (SODA 2012) (2012)","DOI":"10.1137\/1.9781611973099.18"},{"key":"59_CR24","doi-asserted-by":"crossref","unstructured":"Wulff-Nilsen, C.: Approximate distance oracles with improved query time. arXiv abs\/1202.2336 (2012)","DOI":"10.1137\/1.9781611973099.18"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:13:07Z","timestamp":1558912387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}