{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:00:17Z","timestamp":1729627217934,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/icnp.2016.7784451","type":"proceedings-article","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T07:55:26Z","timestamp":1481961326000},"page":"1-10","source":"Crossref","is-referenced-by-count":6,"title":["Optimal link-disjoint node-\u201csomewhat disjoint\u201d paths"],"prefix":"10.1109","author":[{"given":"Jose","family":"Yallouz","sequence":"first","affiliation":[]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Babarczi","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Mendelson","sequence":"additional","affiliation":[]},{"given":"Ariel","family":"Orda","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/INFCOM.2013.6566883"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/2637364.2591997"},{"year":"2001","author":"cormen","journal-title":"Introduction to Algorithms","key":"ref12"},{"year":"1998","author":"bhandari","journal-title":"Survivable Networks Algorithms for Diverse Routing","key":"ref13"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","article-title":"Finding two disjoint paths between two pairs of vertices in a graph","volume":"25","author":"perl","year":"1978","journal-title":"J ACM"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/322203.322207"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/978-3-540-24749-4_31"},{"year":"1979","author":"garey","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","key":"ref18"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1007\/978-3-540-27836-8_21"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TIT.1956.1056816"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.4064\/fm-10-1-96-115"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TNET.2005.863451","article-title":"On the complexity of and algorithms for finding the shortest path with a disjoint counterpart","volume":"14","author":"xu","year":"2006","journal-title":"IEEE\/ACM Trans Netw"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/0166-218X(90)90024-7"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/2755573.2755608"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/INFCOM.2004.1354543"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1002\/net.3230140209"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1002\/net.3230040204"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TNET.2007.893884"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/s00453-011-9583-5"},{"key":"ref22","article-title":"On a routing problem","author":"bellman","year":"1956","journal-title":"DTIC Document Tech Rep"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s00453-010-9411-3"}],"event":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","start":{"date-parts":[[2016,11,8]]},"location":"Singapore","end":{"date-parts":[[2016,11,11]]}},"container-title":["2016 IEEE 24th International Conference on Network Protocols (ICNP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7774710\/7784399\/07784451.pdf?arnumber=7784451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T16:47:16Z","timestamp":1568652436000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7784451\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icnp.2016.7784451","relation":{},"subject":[],"published":{"date-parts":[[2016,11]]}}}