{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:08:42Z","timestamp":1725487722770},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401971"},{"type":"electronic","value":"9783540448648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44864-0_54","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T19:09:48Z","timestamp":1184612988000},"page":"518-523","source":"Crossref","is-referenced-by-count":2,"title":["Reliability Problem on All Pairs Quickest Paths"],"prefix":"10.1007","author":[{"given":"Bang","family":"Young-Cheol","sequence":"first","affiliation":[]},{"given":"Choo","family":"Hyunseung","sequence":"additional","affiliation":[]},{"given":"Mun","family":"Youngsong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Y. L. Chen, Y. H. Chin, \u201cThe quickest path problem\u201d, Computers and Operations Research vol. 17, no. 2, pp. 153\u2013161.","DOI":"10.1016\/0305-0548(90)90039-A"},{"issue":"5","key":"54_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0020-0190(93)90214-T","volume":"45","author":"D. T. Lee","year":"1993","unstructured":"D. T. Lee and E. Papadopoulou. \u201cThe all-pairs quickest path problem\u201d, Information Processing Letters, 45(5): 261\u2013267, 1993.","journal-title":"Information Processing Letters"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/trsc.10.2.113","volume":"10","author":"J. F. Mollenauer","year":"1976","unstructured":"J. F. Mollenauer, \u201cOn the fastest routes for convoy-type traffic in flow-rate-constrained networks\u201d Transportation Science, vol. 10, pp. 113\u2013124, 1976.","journal-title":"Transportation Science"},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"N. S. V. Rao and S. G. Batsell, \u201cAlgorithm for minimum end-to-end delay paths\u201d, IEEE Communications Letters, vol. 1, No. 5, pp. 152\u2013154.","DOI":"10.1109\/4234.625044"},{"key":"54_CR5","doi-asserted-by":"crossref","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 Operations Research, vol. 18, no.6, pp. 579\u2013584.","DOI":"10.1016\/0305-0548(91)90063-W"},{"key":"54_CR6","doi-asserted-by":"crossref","unstructured":"Guoliang Xue, \u201cEnd-to-End data paths: Quickest or most reliable?\u201d, IEEE Communications Letters, vol. 2, no. 6, pp. 156\u2013158.","DOI":"10.1109\/4234.681357"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Y. C. Bang, S. Radhakrishnan, N. S. V. Rao, and S. G. Batsell, \u201cOn update algorithms for quickest paths\u201d, Computer Communications, vol. 23, pp. 1064\u20131068.","DOI":"10.1016\/S0140-3664(00)00158-4"},{"key":"54_CR8","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest, \u201cIntroduction to Algorithms\u201d, New York: McGraw-Hill, 1990."},{"issue":"4\/5","key":"54_CR9","first-page":"235","volume":"17","author":"N. S. V. Rao","year":"2002","unstructured":"N. S. V. Rao and N. Manickam. General quickest paths and path-tables. Computer Systems: Science and Engineering, 17(4\/5):235\u2013239, 2002.","journal-title":"Computer Systems: Science and Engineering"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"N. S. V. Rao. LetLets for end-to-end delay minimization in distributed computing over Internet Using two-paths. International Journal of High Performance Computing Applications, 16(3), 2002.","DOI":"10.1177\/10943420020160030801"},{"key":"54_CR11","unstructured":"W. C. Grimmell and N. S. V. Rao. On source-based route computation for quickest paths under dynamic bandwidth constraints. Journal of Foundations of Computer Science, 1002, in press."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44864-0_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T04:33:46Z","timestamp":1556685226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44864-0_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401971","9783540448648"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44864-0_54","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}