{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:17Z","timestamp":1750307057403,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T00:00:00Z","timestamp":1345593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,22]]},"DOI":"10.1145\/2348543.2348599","type":"proceedings-article","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T13:09:52Z","timestamp":1346159392000},"page":"419-422","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Physarum optimization"],"prefix":"10.1145","author":[{"given":"Yuning","family":"Song","sequence":"first","affiliation":[{"name":"Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huadong","family":"Ma","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios V.","family":"Vasilakos","sequence":"additional","affiliation":[{"name":"University of Western Macedonia, Kozani, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/381677.381691"},{"key":"e_1_3_2_1_2_1","volume-title":"Minimal Exposure Path Algorithms for Directional Sensor Networks,\" in Proc. of GLOBECOM","author":"Liu L.","year":"2009","unstructured":"L. Liu , X. Zhang , and H. Ma , \" Minimal Exposure Path Algorithms for Directional Sensor Networks,\" in Proc. of GLOBECOM , 2009 . L. Liu, X. Zhang, and H. Ma, \"Minimal Exposure Path Algorithms for Directional Sensor Networks,\" in Proc. of GLOBECOM, 2009."},{"key":"e_1_3_2_1_3_1","first-page":"99","article-title":"Minimum-risk path finding by an adaptive amoebal network","author":"Nakagaki T.","year":"2007","unstructured":"T. Nakagaki , M. Iima , T. Ueda , Y. Nishiura , T. Saigusa , A. Tero , R. Kobayashi , and K. Showalter , \" Minimum-risk path finding by an adaptive amoebal network ,\" Phys. Rev. Lett. , 99 , 2007 . T. Nakagaki, M. Iima, T. Ueda, Y. Nishiura, T. Saigusa, A. Tero, R. Kobayashi, and K. Showalter, \"Minimum-risk path finding by an adaptive amoebal network,\" Phys. Rev. Lett., 99, 2007.","journal-title":"Phys. Rev. Lett."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1126\/science.1177894"},{"key":"e_1_3_2_1_5_1","volume-title":"The Steiner Tree Problem,\" North-Holland","author":"Hwang F. K.","year":"1992","unstructured":"F. K. Hwang , D. S. Richards , and P. Winter , \" The Steiner Tree Problem,\" North-Holland , Amsterdam , 1992 . F. K. Hwang, D. S. Richards, and P. Winter, \"The Steiner Tree Problem,\" North-Holland, Amsterdam, 1992."}],"event":{"sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"acronym":"Mobicom'12","name":"Mobicom'12: The 18th Annual International Conference on Mobile Computing and Networking","location":"Istanbul Turkey"},"container-title":["Proceedings of the 18th annual international conference on Mobile computing and networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2348543.2348599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2348543.2348599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:12Z","timestamp":1750238472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2348543.2348599"}},"subtitle":["a new heuristic algorithm to minimal exposure problem"],"short-title":[],"issued":{"date-parts":[[2012,8,22]]},"references-count":5,"alternative-id":["10.1145\/2348543.2348599","10.1145\/2348543"],"URL":"https:\/\/doi.org\/10.1145\/2348543.2348599","relation":{},"subject":[],"published":{"date-parts":[[2012,8,22]]},"assertion":[{"value":"2012-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}