{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:37:10Z","timestamp":1725565030923},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221142"},{"type":"electronic","value":"9783540246855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24685-5_102","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T21:18:16Z","timestamp":1283980696000},"page":"611-614","source":"Crossref","is-referenced-by-count":0,"title":["On Algorithm for All-Pairs Most Reliable Quickest Paths"],"prefix":"10.1007","author":[{"given":"Young-Cheol","family":"Bang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inki","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"102_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/3-540-44864-0_54","volume-title":"Computational Science - ICCS 2003","author":"Y.C. Bang","year":"2003","unstructured":"Bang, Y.C., Choo, H., Mun, Y.: Reliability Problem on All Pairs Quickest Paths. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02660, pp. 518\u2013523. Springer, Heidelberg (2003)"},{"key":"102_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(93)90057-G","volume":"46","author":"G.H. Chen","year":"1993","unstructured":"Chen, G.H., Hung, Y.C.: On the quickest path problem. Information Processing Letters\u00a046, 125\u2013128 (1993)","journal-title":"Information Processing Letters"},{"key":"102_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0020-0190(93)90214-T","volume":"45","author":"D.T. Lee","year":"1993","unstructured":"Lee, D.T., Papadopoulou, E.: The all-pairs quickest path problem. Information Processing Letters\u00a045, 261\u2013267 (1993)","journal-title":"Information Processing Letters"},{"issue":"6","key":"102_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/4234.681357","volume":"2","author":"G. Xue","year":"1998","unstructured":"Xue, G.: End-to-end data paths: Quickest or most reliable? IEEE Communications Letters\u00a02(6), 156\u2013158 (1998)","journal-title":"IEEE Communications Letters"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24685-5_102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T05:41:49Z","timestamp":1553060509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24685-5_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221142","9783540246855"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24685-5_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}