{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T05:59:04Z","timestamp":1774677544034,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540688655","type":"print"},{"value":"9783540688808","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_5","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"27-37","source":"Crossref","is-referenced-by-count":20,"title":["Engineering Label-Constrained Shortest-Path Algorithms"],"prefix":"10.1007","author":[{"given":"Chris","family":"Barrett","sequence":"first","affiliation":[]},{"given":"Keith","family":"Bisset","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Holzer","sequence":"additional","affiliation":[]},{"given":"Goran","family":"Konjevod","sequence":"additional","affiliation":[]},{"given":"Madhav","family":"Marathe","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Barrett, C., Birkbigler, K., Smith, L., Loose, V., Beckman, R., Davis, J., Roberts, D., Williams, M.: An operational description of TRANSIMS. Technical report, Los Alamos National Laboratory (1995)"},{"key":"5_CR2","unstructured":"Barrett, C.L., Bisset, K., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering the label-constrained shortest-path algorithm. Technical report, NDSSL, Virginia Tech. (2007)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45749-6_15","volume-title":"Algorithms - ESA 2002","author":"C.L. Barrett","year":"2002","unstructured":"Barrett, C.L., Bisset, K., Jacob, R., Konjevod, G., Marathe, M.V.: Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 126\u2013138. Springer, Heidelberg (2002)"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"C.L. Barrett","year":"2000","unstructured":"Barrett, C.L., Jacob, R., Marathe, M.V.: Formal-language-constrained path problems. SIAM J. Comput.\u00a030(3), 809\u2013837 (2000)","journal-title":"SIAM J. Comput."},{"key":"5_CR5","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, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/347792.347814","volume":"4","author":"R. Jacob","year":"1999","unstructured":"Jacob, R., Marathe, M.V., Nagel, K.: A computational study of routing algorithms for realistic transportation networks. ACM Journal of Experimental Algorithms\u00a04(6) (1999)","journal-title":"Journal of Experimental Algorithmics"},{"issue":"6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"A.O. Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput.\u00a024(6), 1235\u20131258 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"5_CR8","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":"5_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(88)90198-6","volume":"28","author":"J.-F. Romeuf","year":"1988","unstructured":"Romeuf, J.-F.: Shortest path under rational constraint. Information Processing Letters\u00a028, 245\u2013248 (1988)","journal-title":"Information Processing Letters"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01840435","volume":"1","author":"R. Sedgewick","year":"1986","unstructured":"Sedgewick, R., Vitter, J.S.: Shortest paths in euclidean graphs. Algorithmica\u00a01(1), 31\u201348 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1287\/trsc.37.3.278.16042","volume":"37","author":"H.D. Sherali","year":"2003","unstructured":"Sherali, H.D., Jeenanunta, C., Hobeika, A.G.: Time-dependent, label-constrained shortest path problems with applications. Transportation Science\u00a037(3), 278\u2013293 (2003)","journal-title":"Transportation Science"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.20120","volume":"48","author":"H.D. Sherali","year":"2006","unstructured":"Sherali, H.D., Jeenanunta, C., Hobeika, A.G.: The approach-dependent, time-dependent, label-constrained shortest path problems. Networks\u00a048(2), 57\u201367 (2006)","journal-title":"Networks"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Graph-theoretic methods in database theory. In: PODS, pp. 230\u2013242 (1990)","DOI":"10.1145\/298514.298576"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:09Z","timestamp":1620015429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}