{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:40Z","timestamp":1725796600637},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_39","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"453-464","source":"Crossref","is-referenced-by-count":4,"title":["Improved Approximation for Time-Dependent Shortest Paths"],"prefix":"10.1007","author":[{"given":"Masoud","family":"Omran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"39_CR1","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1002\/net.3230230808","volume":"23","author":"D.P. Bertsekas","year":"1993","unstructured":"Bertsekas, D.P.: A simple and fast label correcting algorithm for shortest paths. Networks\u00a023(7), 703\u2013709 (1993)","journal-title":"Networks"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2003.12.019","volume":"92","author":"G.S. Brodal","year":"2004","unstructured":"Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. Electronic Notes in Theoretical Computer Science\u00a092, 3\u201315 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"3","key":"39_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K.L. Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications\u00a014(3), 493\u2013498 (1966)","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"7","key":"39_CR4","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0191-2615(01)00012-1","volume":"36","author":"C.F. Daganzo","year":"2002","unstructured":"Daganzo, C.F.: Reversibility of the time-dependent shortest path problem. Transportation Research\u00a036(7), 665\u2013668 (2002)","journal-title":"Transportation Research"},{"key":"39_CR5","unstructured":"Dean, B.C.: Shortest paths in FIFO time-dependent networks: Theory and algorithms. Technical report, MIT Department of Computer Science (2004)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Dehne, F., Omran, M.T., Sack, J.-R.: Shortest paths in time-dependent FIFO networks using edge load forecasts. In: Proceedings of the 2nd International Workshop on Computational Transportation Science, pp. 1\u20136 (2009)","DOI":"10.1145\/1645373.1645374"},{"issue":"1-2","key":"39_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00453-010-9461-6","volume":"62","author":"F. Dehne","year":"2012","unstructured":"Dehne, F., Omran, M.T., Sack, J.-R.: Shortest paths in time-dependent FIFO networks. Algorithmica\u00a062(1-2), 416\u2013435 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT 2008, pp. 205\u2013216 (2008)","DOI":"10.1145\/1352431.1352459"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 327\u2013341 (2011)","DOI":"10.1137\/1.9781611973082.27"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. Algorithmica, 1\u201323 (2012)","DOI":"10.1137\/1.9781611973082.27"},{"issue":"3","key":"39_CR12","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd International Conference on Data Engineering, p. 10 (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"39_CR14","unstructured":"Kontogiannis, S.C., Zaroliagis, C.D.: Distance oracles for time-dependent networks. CoRR, abs\/1309.4973 (2013)"},{"issue":"1","key":"39_CR15","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0377-2217(94)E0349-G","volume":"83","author":"K. Nachtigall","year":"1995","unstructured":"Nachtigall, K.: Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research\u00a083(1), 154\u2013166 (1995)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"39_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. J. ACM\u00a037(3), 607\u2013625 (1990)","journal-title":"J. ACM"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A. Orda","year":"1991","unstructured":"Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks\u00a021, 295\u2013319 (1991)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:31:28Z","timestamp":1558938688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}