{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:35:51Z","timestamp":1772206551961,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology (COST) through COST Action CA15127 RECODIS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hungarian Scientific Research Fund through OTKA","award":["K124171"],"award-info":[{"award-number":["K124171"]}]},{"DOI":"10.13039\/100005156","name":"Post-Doctoral Research Fellowship of the Alexander von Humboldt Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/tnet.2018.2823912","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T20:38:10Z","timestamp":1526416690000},"page":"1110-1122","source":"Crossref","is-referenced-by-count":19,"title":["Minimum-Weight Link-Disjoint Node-\u201cSomewhat Disjoint\u201d Paths"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3724-4311","authenticated-orcid":false,"given":"Jose","family":"Yallouz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4064-1238","authenticated-orcid":false,"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1644-2172","authenticated-orcid":false,"given":"Peter","family":"Babarczi","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Mendelson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5561-6599","authenticated-orcid":false,"given":"Ariel","family":"Orda","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","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"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354543"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755608"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893884"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2606342"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2438254"},{"key":"ref16","author":"bhandari","year":"1998","journal-title":"Survivable Networks Algorithms for Diverse Routing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522976"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2684909"},{"key":"ref19","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1764873.1764885"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc6372"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056816"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"ref2","year":"2008","journal-title":"Ethernet Ring Protection Switching"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90024-7"},{"key":"ref1","author":"tapolcai","year":"2014","journal-title":"Internet Optical Infrastructure - Issues on Monitoring and Failure Restoration"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/322203.322207"},{"key":"ref21","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"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_31"},{"key":"ref26","year":"2018","journal-title":"Lemon A c++ Library for Efficient Modeling and Optimization in Networks"},{"key":"ref25","year":"2018","journal-title":"Minimum-Weight Link-Disjoint (MWLD) Paths Simulator C++ Source Code"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8385578\/08359355.pdf?arnumber=8359355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T04:21:28Z","timestamp":1643170888000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8359355\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":27,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2018.2823912","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}