{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:07:14Z","timestamp":1725574034489},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220541"},{"type":"electronic","value":"9783540247074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24707-4_126","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:05:36Z","timestamp":1294419936000},"page":"1125-1133","source":"Crossref","is-referenced-by-count":1,"title":["On Algorithms for Minimum-Cost Quickest Paths with Multiple Delay-Bounds"],"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":"Sungchang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byungjun","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"126_CR1","doi-asserted-by":"crossref","unstructured":"Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicasting for multimedia applications. In: Proc. IEEE INFOCOM 1992, pp. 2078\u20132085 (1992)","DOI":"10.1109\/INFCOM.1992.263480"},{"key":"126_CR2","unstructured":"Sun, Q., Langendoerfer, H.: Efficient multicast routing for delay-sensitive applications. In: Proc. Second Workshop Protocols Multimedia Systems (PROMS 1995), October 1995, pp. 452\u2013458 (1995)"},{"key":"126_CR3","unstructured":"Widyono, R.: The design and evaluation of routing algorithms for real-time channels. In: International Computer Science Institute, University of California at Berkeley, Tech. Rep. ICSI TR-94-024 (June 1994)"},{"key":"126_CR4","doi-asserted-by":"crossref","unstructured":"Alrabiah, T., Znati, T.: Low-Cost, Bounded-Delay Multicast Routing for QoS-Based Networks. In: Seventh International Conference on Computer Communications and Networks, Lafayette, Louisiana, October 1998, pp. 304\u2013311 (1998)","DOI":"10.1109\/ICCCN.1998.739931"},{"key":"126_CR5","unstructured":"Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for delayconstrained minimum-cost multicasting. In: Proc. IEEE INFOCOM 1995, pp. 377\u2013385 (1995)"},{"key":"126_CR6","doi-asserted-by":"crossref","unstructured":"Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE\/ACM Transactions on Networking\u00a08(2), 239\u2013250","DOI":"10.1109\/90.842145"},{"key":"126_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/trsc.10.2.113","volume":"10","author":"J.F. Mollenauer","year":"1976","unstructured":"Mollenauer, J.F.: On the fastest routes for convoy-type traffic in flow-rate-constrained networks. Transportation Science\u00a010, 113\u2013124 (1976)","journal-title":"Transportation Science"},{"key":"126_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Y.L., Chin, Y.H.: The quickest path problem. Computers and Operations Research\u00a017(2), 153\u2013161","DOI":"10.1016\/0305-0548(90)90039-A"},{"key":"126_CR9","doi-asserted-by":"crossref","unstructured":"Rosen, J.B., Sun, S.Z., Xue, G.L.: Algorithms for the quickest path problem and the enumeration of quickest paths. Computers and Operations Research\u00a018(6), 579\u2013584","DOI":"10.1016\/0305-0548(91)90063-W"},{"key":"126_CR10","doi-asserted-by":"crossref","unstructured":"Hung, Y.C., Chen, G.H.: Distributed algorithms for the quickest path problem. Parallel Computing\u00a018, 823\u2013834","DOI":"10.1016\/0167-8191(92)90048-C"},{"key":"126_CR11","doi-asserted-by":"crossref","unstructured":"Martins, E.Q.V., Santos, J.L.E.: An algorithms for the quickest path problem. Operation Research Letters\u00a020, 195\u2013198","DOI":"10.1016\/S0167-6377(97)00008-4"},{"key":"126_CR12","doi-asserted-by":"crossref","unstructured":"Rao, N.S.V., Batsell, S.G.: Algorithm for minimum end-to-end delay paths. IEEE Communications Letters\u00a01(5), 152\u2013154","DOI":"10.1109\/4234.625044"},{"key":"126_CR13","doi-asserted-by":"crossref","unstructured":"Bang, Y.C., Radhakrishnan, S., Rao, N.S.V., Batsell, S.G.: On update algorithms for quickest paths. Computer Communications\u00a023, 1064\u20131068","DOI":"10.1016\/S0140-3664(00)00158-4"},{"key":"126_CR14","doi-asserted-by":"crossref","unstructured":"Xue, G.: End-to-End data paths: Quickest or most reliable? IEEE Communications Letters\u00a02(6), 156\u2013158","DOI":"10.1109\/4234.681357"},{"key":"126_CR15","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1990)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24707-4_126.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:54:25Z","timestamp":1605761665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24707-4_126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220541","9783540247074"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24707-4_126","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}