{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:00:09Z","timestamp":1729674009175,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1109\/ipdps.2006.1639513","type":"proceedings-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T19:59:56Z","timestamp":1152561596000},"page":"8 pp.","source":"Crossref","is-referenced-by-count":0,"title":["A nature-inspired algorithm for the disjoint paths problem"],"prefix":"10.1109","author":[{"given":"M.J.","family":"Blesa","sequence":"first","affiliation":[]},{"given":"C.","family":"Blum","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.12.003"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00351-X"},{"key":"18","first-page":"129","volume":"2","author":"kramer","year":"1984","journal-title":"Advances in Computing Research"},{"journal-title":"Approximation algorithms for disjoint paths problems","year":"1996","author":"kleinberg","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0370-6"},{"key":"13","first-page":"200","article-title":"Gossiping in vertex-disjoing paths triode in d-dimensional grids and planar graphs","volume":"726","author":"hromkovic?","year":"1993","journal-title":"LNCS"},{"key":"14","first-page":"85","author":"karp","year":"1972","journal-title":"Compexity of Computer Computations chapter Reducibility among combinatorial problems"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202792"},{"year":"0","key":"20"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00223-2"},{"key":"23","first-page":"134","article-title":"Efficient all-optical routing","author":"raghavan","year":"1994","journal-title":"27th Annu ACM Symp Theory of Computing"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/115992.115998"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0177-Z"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365675"},{"key":"2","first-page":"567","article-title":"Improved bounds for all-optical routing","author":"aumann","year":"1995","journal-title":"Proc 6th ACM-SIAM Symp Discrete Algorithms"},{"journal-title":"Ottimizzazione apprendimento automatico ed algoritmi basati su metafora naturale","year":"1992","author":"dorigo","key":"10"},{"key":"1","first-page":"412","article-title":"Efficient routing and scheduling algorithms for optical networks","author":"aggarwal","year":"1994","journal-title":"5th ACM-SIAM Sympo sium Discrete Algorithms"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39890-5_13"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2003.821450"},{"year":"0","key":"5"},{"key":"4","first-page":"160","article-title":"Ant colony optimization for the maximum edge-disjoint paths problem","volume":"3005","author":"blesa","year":"2004","journal-title":"LNCS"},{"key":"9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","article-title":"AntNet: Distributed stigmergetic control for communications networks","volume":"9","author":"di caro","year":"1998","journal-title":"Journal of Artificial Intelligence Research"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290683"}],"event":{"name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","start":{"date-parts":[[2006,4,25]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2006,4,29]]}},"container-title":["Proceedings 20th IEEE International Parallel & Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10917\/34366\/01639513.pdf?arnumber=1639513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T23:22:33Z","timestamp":1555716153000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1639513\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2006.1639513","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}