{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:22Z","timestamp":1767339922215},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642048012"},{"type":"electronic","value":"9783642048029"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04802-9_11","type":"book-chapter","created":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T14:32:56Z","timestamp":1256653976000},"page":"220-238","source":"Crossref","is-referenced-by-count":2,"title":["Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Czekaj","sequence":"first","affiliation":[]},{"given":"Les\u0142aw","family":"Socha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Englewood Cliffs (1993)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<9::AID-NET2>3.0.CO;2-H","volume":"30","author":"C. Alexopoulos","year":"1997","unstructured":"Alexopoulos, Ch.: State space partitioning methods for stochastic shortest path problems. Networks\u00a030, 9\u201321 (1997)","journal-title":"Networks"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Quarterly of Applied Mathematics\u00a016, 87\u201390 (1958)","journal-title":"Quarterly of Applied Mathematics"},{"key":"11_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge\/ McGraw-Hill Book Company, Boston (1990)"},{"key":"11_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\u00a0note on two problems in connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"11_CR6","first-page":"345","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Comm.\u00a0ACM\u00a05, 345 (1962)","journal-title":"Comm.\u00a0ACM"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederikson","year":"1987","unstructured":"Frederikson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J.\u00a0Comput.\u00a016, 1004\u20131022 (1987)","journal-title":"SIAM J.\u00a0Comput."},{"key":"11_CR8","series-title":"Lecture Notes in Economics and Mathematical Systems","first-page":"109","volume-title":"Proc. 3rd Conf. Multiple Criteria Decision Making \u2013\u00a0Theory and Applications","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bicriterion path problems. In: Proc. 3rd Conf. Multiple Criteria Decision Making \u2013\u00a0Theory and Applications. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0117, pp. 109\u2013127. Springer, Heidelberg (1979)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D.B. Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM\u00a024, 1\u201313 (1977)","journal-title":"Journal of the ACM"},{"key":"11_CR10","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 use in improved network optimization problems. Journal of the ACM\u00a034, 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1137\/0216065","volume":"16","author":"A. Moffat","year":"1987","unstructured":"Moffat, A., Takaoka, T.: An all pairs shortest path algorithm with expected time O(n 2logn). SIAM J.\u00a0Comput.\u00a016, 1023\u20131031 (1987)","journal-title":"SIAM J.\u00a0Comput."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1287\/trsc.30.3.220","volume":"30","author":"I. Murthy","year":"1996","unstructured":"Murthy, I., Sakar, S.: A\u00a0relaxation-based pruning technique for a\u00a0class of stochastic shortest path problems. Transportation Science\u00a030, 220\u2013236 (1996)","journal-title":"Transportation Science"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0377-2217(97)00264-6","volume":"103","author":"I. Murthy","year":"1997","unstructured":"Murthy, I., Sarkar, S.: Exact algorithms for the stochastic shortest path problem with a\u00a0decreasing deadline utility function. European Journal of Operational Research\u00a0103, 209\u2013229 (1997)","journal-title":"European Journal of Operational Research"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"A.J.V. Skriver","year":"2000","unstructured":"Skriver, A.J.V., Anderson, K.A.: A\u00a0label correcting approach for solving bicriterion shortest-path problems. Computers &\u00a0Operations Research\u00a027, 507\u2013524 (2000)","journal-title":"Computers &\u00a0Operations Research"},{"key":"11_CR15","unstructured":"Tsaggouris, G., Zaroliagis, Ch.D.: Improved FPTAS for Multiobjective Shortest Paths with Applications. Technical report no.\u00a0TR 20050703 (July 2005)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Tsaggouris, G., Zaroliagis, Ch.D.: Multiobjective Optization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications. Technical report no. TR 2006\/03\/01 (March 2006)","DOI":"10.1007\/11940128_40"}],"container-title":["IFIP Advances in Information and Communication Technology","System Modeling and Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04802-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:37:19Z","timestamp":1558611439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04802-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642048012","9783642048029"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04802-9_11","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2009]]}}}