{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T10:48:20Z","timestamp":1756810100261,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319228488"},{"type":"electronic","value":"9783319228495"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22849-5_2","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T12:07:51Z","timestamp":1439208471000},"page":"13-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Restricted Shortest Path in Temporal Graphs"],"prefix":"10.1007","author":[{"given":"Sudip","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Ganguly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H","volume":"29","author":"X Cai","year":"1997","unstructured":"Cai, X., Kloks, T., Wong, C.K.: Time-varying shortest path problems with constraints. Networks 29(3), 141\u2013150 (1997)","journal-title":"Networks"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/net.20247","volume":"52","author":"WM Carlyle","year":"2008","unstructured":"Carlyle, W.M., Royset, J.O., Kevin Wood, R.: Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 52(4), 256\u2013270 (2008)","journal-title":"Networks"},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1287\/opre.45.5.649","volume":"45","author":"PR Day","year":"1997","unstructured":"Day, P.R., Ryan, D.M.: Flight attendant rostering for short-haul airline operations. Oper. Res. 45(5), 649\u2013661 (1997)","journal-title":"Oper. Res."},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F Ergun","year":"2002","unstructured":"Ergun, F., Sinha, R., Zhang, L.: An improved FPTAS for restricted shortest path. Inf. Process. Lett. 83(5), 287\u2013291 (2002)","journal-title":"Inf. Process. Lett."},{"key":"2_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"key":"2_CR6","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 156\u2013165. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Demers, A.J.: Spatial gossip and resource location protocols. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, 6\u20138 July 2001, pp. 163\u2013172 (2001)","DOI":"10.1145\/380752.380796"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: Proceedings IEEE INFOCOM 2001, The Conference on Computer Communications, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, Twenty Years into the Communications Odyssey, Anchorage, Alaska, USA, 22\u201326 April 2001, pp. 834\u2013843 (2001)","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Li, Y., Harms, J., Holte, R.: Fast exact multiconstraint shortest path algorithms. In: IEEE International Conference on Communications, ICC 2007, June 2007, pp. 123\u2013130 (2007)","DOI":"10.1109\/ICC.2007.29"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/90.748088","volume":"6","author":"D Lorenz","year":"1998","unstructured":"Lorenz, D., Orda, A.: QoS routing in networks with uncertain parameters. IEEE\/ACM Trans. Netw. 6(6), 768\u2013778 (1998)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"2_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-662-44465-8_47","volume-title":"Mathematical Foundations of Computer Science 2014","author":"O Michail","year":"2014","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 553\u2013564. Springer, Heidelberg (2014)"},{"issue":"1","key":"2_CR16","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. Eur. J. Oper. Res. 83(1), 154\u2013166 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2_CR17","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1109\/TNET.2004.836112","volume":"12","author":"P Van Mieghem","year":"2004","unstructured":"Van Mieghem, P., Kuipers, F.: Concepts of exact QoS routing algorithms. IEEE\/ACM Trans. Netw. 12(5), 851\u2013864 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"9","key":"2_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22849-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:08:27Z","timestamp":1748560107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22849-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228488","9783319228495"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22849-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}