{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:05:25Z","timestamp":1725512725319},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/netcod.2013.6570835","type":"proceedings-article","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T15:40:54Z","timestamp":1376494854000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Multicut lower bounds via network coding"],"prefix":"10.1109","author":[{"given":"Anna","family":"Blasiak","sequence":"first","affiliation":[]}],"member":"263","reference":[{"year":"2005","author":"lehman","journal-title":"Network Coding","key":"19"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1007\/s10922-005-9019-0"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/TIT.2003.820015"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/18.850663"},{"key":"16","article-title":"Tighter cut-based bounds for kpairs communication problems","author":"harvey","year":"2005","journal-title":"43rd Allerton Conference on Communication Control and Computing"},{"key":"13","article-title":"Network coding: The case of multiple unicast sessions","author":"li","year":"2004","journal-title":"Allerton Conference on Communications"},{"year":"2004","author":"harvey","journal-title":"Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem","key":"14"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/ITW.2004.1405308"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/TIT.2006.874531"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1145\/331524.331526"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1145\/1502793.1502795"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1137\/S0097539792225297"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/TIT.2005.847712"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/SFCS.2001.959906"},{"key":"6","first-page":"454","article-title":"Improved results for directed multicut","author":"gupta","year":"2003","journal-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1145\/1250790.1250888"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1137\/S0097539793243016"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/TIT.2002.807285"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1007\/s00493-004-0031-x"}],"event":{"name":"2013 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2013,6,7]]},"location":"Calgary, AB, Canada","end":{"date-parts":[[2013,6,9]]}},"container-title":["2013 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6560497\/6570811\/06570835.pdf?arnumber=6570835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:13:37Z","timestamp":1490217217000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6570835\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/netcod.2013.6570835","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}