{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T01:33:58Z","timestamp":1730252038220,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/icnc.2012.6234600","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T19:43:57Z","timestamp":1342727037000},"page":"1001-1006","source":"Crossref","is-referenced-by-count":0,"title":["An algorithm for the shortest pairs of arc-disjoint paths problem"],"prefix":"10.1109","author":[{"given":"Zhishuai","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"252","article-title":"Min Max-time Flow Problem in capacitated Dynamic Networks","volume":"36","author":"pang","year":"2010","journal-title":"Computer Engineering"},{"key":"15","first-page":"208","article-title":"A Faster Algorithm for Shortest Path","volume":"29","author":"duan","year":"1994","journal-title":"Journal of Southwest Jiaotong University"},{"key":"16","first-page":"165","article-title":"Shortest Path Algorithm in Time-dependent Networks","volume":"25","author":"tan","year":"2002","journal-title":"Chinese J Computers"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.76"},{"journal-title":"Theory of Network Algorithms and Complexity","year":"2003","author":"xie","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.017"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.127"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935329"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1080\/00207176708921826"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2009.75"},{"key":"10","first-page":"389","article-title":"Improvement and Analysis of Widest Disjoint Paths Algorithm for Proportional Routing","volume":"33","author":"zhu","year":"2007","journal-title":"Journal of East China University of Science and Technology"},{"key":"7","article-title":"A Distributed Algorithm for Finding Shortest Pairs of Disjoint Paths","author":"ogier","year":"0","journal-title":"Proc IEEE INFOCOM 1989"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"journal-title":"Edge-Disjoint Routes and Blocking Routes Problems","year":"1969","author":"takamori","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00153-1"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/115994.115998"}],"event":{"name":"2012 8th International Conference on Natural Computation (ICNC)","start":{"date-parts":[[2012,5,29]]},"location":"Chongqing, Sichuan, China","end":{"date-parts":[[2012,5,31]]}},"container-title":["2012 8th International Conference on Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6227653\/6234502\/06234600.pdf?arnumber=6234600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T11:46:24Z","timestamp":1490096784000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6234600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icnc.2012.6234600","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}