{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T01:10:20Z","timestamp":1743383420649,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642310195"},{"type":"electronic","value":"9783642310201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31020-1_48","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T16:59:14Z","timestamp":1339520354000},"page":"407-413","source":"Crossref","is-referenced-by-count":0,"title":["A Scalable Algorithm for Finding Delay-Constraint Least-Cost End-to-End Path"],"prefix":"10.1007","author":[{"given":"Yue","family":"Han","sequence":"first","affiliation":[]},{"given":"Zengji","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mingwu","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Jungang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"48_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research\u00a017(1), 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"48_CR2","unstructured":"Widyono, R.: The design and evaluation of routing algorithms for realtime channels. Technical Report TR-94-024, University of California at Berekley (1994)"},{"issue":"20","key":"48_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/90.842145","volume":"8","author":"D.S. Reeves","year":"2000","unstructured":"Reeves, D.S., Salama, H.F., Fang, Y.: A distributed algorithm for delay constrained unicast routing. IEEE\/ACM Trans. Networking\u00a08(20), 239\u2013250 (2000)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"48_CR4","unstructured":"Juttner, A., Szviatovszki, B.: Lagrange relaxation based method for the QoS routing problem. In: INFOCOM, Alaska, pp. 239\u2013250 (2001)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: INFOCOM, Alaska, pp. 834\u2013843 (2001)","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Sola, Y.E., Pourjavad, M.A.: Load balancing effects in DCUR QoS routing algorithm. In: ICCSIT, Beijing, pp. 2273\u20132278 (2009)","DOI":"10.1109\/ICCSIT.2009.5234747"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Agrawal, H., Grah, M.: Optimization of QoS Routing. In: ICIS, Melbourne, pp. 598\u2013603 (2007)","DOI":"10.1109\/ICIS.2007.144"},{"issue":"4","key":"48_CR8","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10732-009-9109-3","volume":"16","author":"A.W. Mohemmed","year":"2010","unstructured":"Mohemmed, A.W., Sahoo, N.C.: Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem. Journal of Heuristics\u00a016(4), 593\u2013616 (2010)","journal-title":"Journal of Heuristics"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Dragos, S., Collier, M., Grah, M.: Macro-routing: a new hierarchical routing protocol. In: GLOBECOM, pp. 1510\u20131514 (2004)","DOI":"10.1109\/GLOCOM.2004.1378235"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Ghosh, D., Acharya, R.: A probabilistic scheme for hierarchical QoS routing. In: ICON, pp. 416\u2013421 (2001)","DOI":"10.1109\/ICON.2001.962378"},{"key":"48_CR11","unstructured":"Puterman, M.L.: Markov decision processes: discrete stochastic dynamic programming. Wiley-Interscience, Mathematics (2005)"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Han, Y., Liu, Z.-J.: A two-time scale MDP-based routing algorithm for DCLC problem. In: IEEE ChinaCom, pp. 1\u20135 (2009)","DOI":"10.1109\/CHINACOM.2009.5339824"},{"issue":"9","key":"48_CR13","first-page":"1617","volume":"6","author":"B.M. Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE JSAC\u00a06(9), 1617\u20131622 (1988)","journal-title":"IEEE JSAC"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31020-1_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:30:28Z","timestamp":1743381028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31020-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642310195","9783642310201"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31020-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}