{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T18:10:07Z","timestamp":1736014207134,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290315"},{"type":"electronic","value":"9783540320791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557654_14","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T13:59:18Z","timestamp":1128434358000},"page":"99-104","source":"Crossref","is-referenced-by-count":0,"title":["Least Cost Multicast Loop Algorithm for Local Computer Network"],"prefix":"10.1007","author":[{"given":"Yong-Jin","family":"Lee","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","first-page":"209","volume":"19","author":"Y. Lee","year":"2004","unstructured":"Lee, Y.: Minimal Cost Heuristic Algorithm for Delay Constrained Loop Network. International Journal of Computer Systems Science &Engineering\u00a019(4), 209\u2013219 (2004)","journal-title":"International Journal of Computer Systems Science &Engineering"},{"issue":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1049\/ip-com:20020672","volume":"149","author":"G. Cheng","year":"2002","unstructured":"Cheng, G., Ansari, N.: On Multiple Additively Constrained Path Selection. IEE Proc. Communications\u00a0149(5), 237\u2013241 (2002)","journal-title":"IEE Proc. Communications"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/LCOMM.2004.823365","volume":"8","author":"G. Cheng","year":"2004","unstructured":"Cheng, G., Ansari, N.: Finding All Hop(s) Shortest Path. IEEE Communications Letters\u00a08(2), 122\u2013124 (2004)","journal-title":"IEEE Communications Letters"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, G., Ansari, N.: Achieving 100% Success Ratio in Finding the Delay Constrained Least Cost Path. In: Proc. of IEEE GLOBECOM 2004, pp. 1505\u20131509 (2004)","DOI":"10.1109\/GLOCOM.2004.1378234"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Juttner, A., Szyiatowszki, M.I., Rajko, Z.: Lagrange relaxation based method for the QoS ruoting problem. In: Proc. IEEE INFOCOM 2001, pp. 859\u2013869 (2001)","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J. Lenster","year":"1981","unstructured":"Lenster, J., Kan, R.: Complexity of Vehicle Routing and Scheduling Problems. Networks\u00a011, 221\u2013227 (1981)","journal-title":"Networks"},{"key":"14_CR7","volume-title":"Network Flows- Theory, Algorithms, and Applica-tions","author":"T. Magnanti","year":"1993","unstructured":"Magnanti, T., Ahuja, R., Orlin, J.: Network Flows- Theory, Algorithms, and Applica-tions. Prentice-Hall, Englewood Cliffs (1993)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557654_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T17:28:34Z","timestamp":1736011714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11557654_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}