{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:27:29Z","timestamp":1761863249333,"version":"3.40.3"},"publisher-location":"Heidelberg","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319016214"},{"type":"electronic","value":"9783319016221"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01622-1_36","type":"book-chapter","created":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T05:36:59Z","timestamp":1374212219000},"page":"317-326","source":"Crossref","is-referenced-by-count":12,"title":["An Algorithm for Finding Shortest Path Tree Using Ant Colony Optimization Metaheuristic"],"prefix":"10.1007","author":[{"given":"Mariusz","family":"G\u0142\u0105bowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartosz","family":"Musznicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Zwierzykowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","DOI":"10.1201\/9780203497289","volume-title":"Spanning Trees and Optimization Problems","author":"B.Y. Wu","year":"2004","unstructured":"Wu, B.Y., Chao, K.-M.: Spanning Trees and Optimization Problems. Chapman & Hall\/CRC Press, USA (2004)"},{"key":"36_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)"},{"issue":"1-2","key":"36_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.2478\/v10248-012-0011-5","volume":"17","author":"M. G\u0142\u0105bowski","year":"2012","unstructured":"G\u0142\u0105bowski, M., Musznicki, B., Nowak, P., Zwierzykowski, P.: Shortest Path Problem Solving Based on Ant Colony Optimization Metaheuristic. International Journal of Image Processing & Communications\u00a017(1-2), 7\u201317 (2012)","journal-title":"International Journal of Image Processing & Communications"},{"key":"36_CR4","unstructured":"G\u0142\u0105bowski, M., Musznicki, B., Nowak, P., Zwierzykowski, P.: ShortestPathACO based strategy to find the Shortest Path between two nodes. In: Proceedings of 2013 IEICE Information and Communication Technology Forum (ICTF), Sarajevo, Bosnia and Herzegovina, pp. 29\u201331 (May 2013)"},{"key":"36_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)"},{"key":"36_CR6","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"36_CR7","volume-title":"Network Optimization: Continuos and Discrete Models","author":"D.P. Bertsekas","year":"1998","unstructured":"Bertsekas, D.P.: Network Optimization: Continuos and Discrete Models. Athena Scientific, Belmont (1998)"},{"issue":"3","key":"36_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1145\/380749.380771","volume":"19","author":"N.F. Maxemchuk","year":"2001","unstructured":"Maxemchuk, N.F., Shur, D.H.: An Internet multicast system for the stock market. ACM Transactions on Computer Systems\u00a019(3), 384\u2013412 (2001)","journal-title":"ACM Transactions on Computer Systems"},{"key":"36_CR9","unstructured":"Pragyansmita, P., Raghavan, S.V.: Survey of Multicast Routing Algorithms and Protocols. In: Proceedings of ICCC 2002, the Fifteenth International Conference on Computer Communication, Washington, DC, USA, pp. 902\u2013926 (2002)"},{"key":"36_CR10","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-31217-5_36","volume-title":"Computer Networks","author":"M. Piechowiak","year":"2012","unstructured":"Piechowiak, M., Zwierzykowski, P.: The Evaluation of Unconstrained Multicast Routing Algorithms in Ad-Hoc Networks. In: Kwiecie\u0144, A., Gaj, P., Stera, P. (eds.) CN 2012. CCIS, vol.\u00a0291, pp. 344\u2013351. Springer, Heidelberg (2012)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Musznicki, B., Tomczak, M., Zwierzykowski, P.: Dijkstra-based Localized Multicast Routing in Wireless Sensor Networks. In: Proceedings of CSNDSP 2012, 8th IEEE, IET International Symposium on Communication Systems, Networks and Digital Signal Processing, Pozna\u0144, Poland, pp. 18\u201320 (July 2012)","DOI":"10.1109\/CSNDSP.2012.6292692"}],"container-title":["Advances in Intelligent Systems and Computing","Image Processing and Communications Challenges 5"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01622-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T15:02:45Z","timestamp":1676818965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-01622-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319016214","9783319016221"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01622-1_36","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}