{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:34:03Z","timestamp":1724135643305},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,4,28]],"date-time":"2017-04-28T00:00:00Z","timestamp":1493337600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"University Grants Committee of the Hong Kong Special Administrative Region, China","award":["AoE\/E-02\/08"],"award-info":[{"award-number":["AoE\/E-02\/08"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10878-017-0132-2","type":"journal-article","created":{"date-parts":[[2017,4,28]],"date-time":"2017-04-28T11:15:55Z","timestamp":1493378155000},"page":"1114-1132","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Langberg\u2013M\u00e9dard multiple unicast conjecture"],"prefix":"10.1007","volume":"34","author":[{"given":"Kai","family":"Cai","sequence":"first","affiliation":[]},{"given":"Guangyue","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,28]]},"reference":[{"issue":"4","key":"132_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li S-YR, Yeung R (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"key":"132_CR2","doi-asserted-by":"crossref","unstructured":"Langberg M, M\u00e9dard M (2009) On the multiple unicast network coding conjecture. In: Proceedings of 47th annual Allerton, pp 222\u2013227","DOI":"10.1109\/ALLERTON.2009.5394800"},{"key":"132_CR3","unstructured":"Li Z, Li B (2004) Network coding: the case of multiple unicast sessions. In: Proceedings of 42nd annual Allerton, pp 11\u201320"},{"key":"132_CR4","volume-title":"Combinatorial optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization. Springer, Berlin"},{"issue":"5","key":"132_CR5","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/LCOMM.2014.040214.140280","volume":"18","author":"Y Yang","year":"2014","unstructured":"Yang Y, Yin X, Chen X, Yang Y, Li Z (2014) A note on the multiple-unicast network coding conjecture. IEEE Commun Lett 18(5):869\u2013872","journal-title":"IEEE Commun Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0132-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0132-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0132-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,9]],"date-time":"2017-10-09T11:43:24Z","timestamp":1507549404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0132-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,28]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["132"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0132-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,28]]}}}