{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:58:08Z","timestamp":1725731888800},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/icbn.2005.1589610","type":"proceedings-article","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T19:29:31Z","timestamp":1140031771000},"page":"145-154 Vol. 1","source":"Crossref","is-referenced-by-count":2,"title":["On computing disjoint paths with dependent cost structure in optical networks"],"prefix":"10.1109","author":[{"given":"A.","family":"Todimala","sequence":"first","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Nebraska Univ., USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Byrav Ramamurthy","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Nebraska Univ., USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.V.","family":"Vinodchandran","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Nebraska Univ., USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Solving asymmetrically weighted optimal or near-optimal disjoint path pair for the survivable optical networks","author":"laborczi","year":"2001","journal-title":"3rd Int Workshop On Design Of Reliable Communication Networks (DRCN 01)"},{"key":"ref3","article-title":"On Finding Disjoint Paths in Single and Dual Link Cost Networks","author":"xu","year":"2004","journal-title":"Proc INFOCOM"},{"year":"2001","author":"vazirani","article-title":"Approximation Algorithms","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1002\/net.3230220705"},{"year":"2001","author":"liu","article-title":"Spare Capacity Allocation method, analysis and algorithms","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1287\/mnsc.17.11.712"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/COMST.2004.5342295"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1002\/net.3230140209"},{"key":"ref9","article-title":"On the Complexity of Computing Least Cost Disjoint Path Pair with Dependent Cost Structure in Optical Networks","author":"todimala","year":"0","journal-title":"Technical Report 2005 TR05-01-03"},{"year":"0","article-title":"Dense Wavelength Division Multiplexing (DWDM)","key":"ref1"}],"event":{"name":"2005 2nd International Conference on Broadband Networks (Broadnets)","start":{"date-parts":[[2005,10,7]]},"location":"Boston, MA, USA","end":{"date-parts":[[2005,10,7]]}},"container-title":["2nd International Conference on Broadband Networks, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10596\/33500\/01589610.pdf?arnumber=1589610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T18:43:53Z","timestamp":1709923433000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1589610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/icbn.2005.1589610","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}