{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:10:12Z","timestamp":1737339012517,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675068"},{"type":"electronic","value":"9783540455516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45551-5_72","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:27:09Z","timestamp":1185935229000},"page":"859-870","source":"Crossref","is-referenced-by-count":6,"title":["On Shortest Path Problems with \u201cNon-Markovian\u201d Link Contribution to Path Lengths"],"prefix":"10.1007","author":[{"given":"Arunabha","family":"Sen","sequence":"first","affiliation":[]},{"given":"K. Sel\u00e7uk","family":"Candan","sequence":"additional","affiliation":[]},{"given":"Afonso","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Beauquier","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Perennes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"issue":"1","key":"72_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"R. Bellman, \u201cOn a Routing Problem\u201d, Quarterly of Applied Mathematics, vol. 16, no. 1, pp. 87\u201390, 1958.","journal-title":"Quarterly of Applied Mathematics"},{"key":"72_CR2","unstructured":"D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1987."},{"key":"72_CR3","doi-asserted-by":"crossref","unstructured":"K.S. Candan and Y. Yang, \u201cLeast-Cost High-Quality Object Retrieval for Distributed Multimedia Collaborations\u201d, IEEE Multimedia Computing and Systems Conference, pp. 649\u2013654, Florence, Italy, June 1999.","DOI":"10.1109\/MMCS.1999.779276"},{"key":"72_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \u201cA Note on Two Problems in Connection with Graphs\u201d, Numerische Mathematik, vol. 1, pp. 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"72_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.2307\/2308750","volume":"66","author":"L.E. Ford","year":"1959","unstructured":"L.E. Ford and S.M. Johnson, \u201cA Tournament Problem\u201d, The American Mathematical Monthly, vol. 66, pp. 387\u2013389, 1959.","journal-title":"The American Mathematical Monthly"},{"key":"72_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G.Y. Handler","year":"1980","unstructured":"G.Y. Handler and I. Zang, \u201cA Dual Algorithm for the Constrained Shortest Path Problem\u201d, Networks, vol. 10, pp. 293\u2013310, 1980.","journal-title":"Networks"},{"key":"72_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A","volume":"31","author":"I. Ioachim","year":"1998","unstructured":"I. Ioachim et. al., \u201cA Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs\u201d, Networks, vol. 31, pp. 193\u2013204, 1998.","journal-title":"Networks"},{"key":"72_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"J.M. Jaffe","year":"1984","unstructured":"J.M. Jaffe, \u201cAlgorithms for Finding Paths with Multiple Constraints\u201d, Networks, vol. 14, pp. 95\u2013116, 1984.","journal-title":"Networks"},{"issue":"3","key":"72_CR9","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"A. Orda and R. Rom, \u201cShortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Lengths\u201d, Journal of the Association for Computing Machinery, vol. 37, no. 3, pp. 605\u2013625, 1990.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"72_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A. Orda","year":"1991","unstructured":"A. Orda and R. Rom, \u201cMinimum Weight Paths with Time-Dependent Networks\u201d, Networks, vol. 21, pp. 295\u2013319, 1991.","journal-title":"Networks"},{"issue":"6","key":"72_CR11","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"J.B. Rosen","year":"1991","unstructured":"J.B. Rosen, S. Z. Sun and G.L. Xue, \u201cAlgorithms for the Quickest Path Problem and the Enumeration of Quickest Paths\u201d, Computers and Operation Research, vol. 18, no. 6, pp. 579\u2013584, 1991.","journal-title":"Computers and Operation Research"},{"key":"72_CR12","doi-asserted-by":"crossref","unstructured":"H.F. Salama, D.S. Reeves and Y. Viniotis, \u201cA Distributed Algorithm for Delay-Constrained Unicast Routing\u201d, IEEE INFOCOM\u201997, pp. 1c.2.1\u20131c.2.8, 1997.","DOI":"10.1109\/INFCOM.1997.635117"},{"key":"72_CR13","unstructured":"A. Sen, K. S. Candan, A. Ferreira, B. Beauquier, S. Perennes, \u201cOn Shortest Path Problems with \u201cnon-Markovian\u201d Link Contribution to Path Lengths\u201d, Tech. Report-00-002, Dept. of Computer Science and Engineering, Arizona State University."},{"issue":"7","key":"72_CR14","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Z. Wang and J. Crowcroft, \u201cQuality-of-Service Routing for Supporting Multimedia Applications\u201d, IEEE Journal on Selected Areas of Communications, vol. 14, no. 7, pp. 1228\u20131234, 1996.","journal-title":"IEEE Journal on Selected Areas of Communications"}],"container-title":["Lecture Notes in Computer Science","Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45551-5_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:38:05Z","timestamp":1737337085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45551-5_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675068","9783540455516"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45551-5_72","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}