{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:19:57Z","timestamp":1744147197476,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/icnsc.2014.6819670","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T14:33:37Z","timestamp":1401460417000},"page":"463-467","source":"Crossref","is-referenced-by-count":2,"title":["Distributed algorithm for shortest path problem via randomized strategy"],"prefix":"10.1109","author":[{"given":"Mohammadreza","family":"Doostmohammadian","sequence":"first","affiliation":[]},{"given":"Sepideh","family":"Pourazarm","sequence":"additional","affiliation":[]},{"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1214\/088342304000000422"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425884"},{"year":"0","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2011.0096"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"13"},{"key":"14","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erdos","year":"1960","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","article-title":"Engineering route planning algorithms","author":"delling","year":"2009","journal-title":"Algorithmics of Large and Complex Networks"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"2","volume":"200","author":"basar","year":"1995","journal-title":"Dynamic Noncooperative Game Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483388"},{"journal-title":"Fulkerson Flows in Networks","year":"0","author":"ford","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.64"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0044459"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980508"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6189954"},{"key":"9","article-title":"On a routing problem","author":"beuman","year":"0","journal-title":"Quarterly of Applied Mathematics"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"}],"event":{"name":"2014 IEEE 11th International Conference on Networking, Sensing and Control (ICNSC)","start":{"date-parts":[[2014,4,7]]},"location":"Miami, FL, USA","end":{"date-parts":[[2014,4,9]]}},"container-title":["Proceedings of the 11th IEEE International Conference on Networking, Sensing and Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6812386\/6819588\/06819670.pdf?arnumber=6819670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T10:07:28Z","timestamp":1498126048000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6819670\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icnsc.2014.6819670","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}