{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:55Z","timestamp":1750307215812,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CCF 1016684CCF 1017430CNS 0721652"],"award-info":[{"award-number":["CCF 1016684CCF 1017430CNS 0721652"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 1016684CCF 1017430CNS 0721652"],"award-info":[{"award-number":["CCF 1016684CCF 1017430CNS 0721652"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090268","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"399-408","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Multicommodity flows and cuts in polymatroidal networks"],"prefix":"10.1145","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana-Champaign, IL"}]},{"given":"Sreeram","family":"Kannan","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana-Champaign, IL"}]},{"given":"Adnan","family":"Raja","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana-Champaign, IL"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana-Champaign, IL"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110110"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250888"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496831"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0015-5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090268"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502795"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70734-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347478"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060674"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793243016"},{"key":"e_1_3_2_1_14_1","volume-title":"Allerton Conf","author":"Goemans M. X.","year":"2009","unstructured":"M. X. Goemans , S. Iwata , and R. Zenklusen . A flow model based on polylinking system. Math. Programming Ser A, to appear. Preliminary version in Proc . Allerton Conf , Sep. 2009 M. X. Goemans, S. Iwata, and R. Zenklusen. A flow model based on polylinking system. Math. Programming Ser A, to appear. Preliminary version in Proc. Allerton Conf, Sep. 2009"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033821"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034044"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167261"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0833"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.3.334"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Submodular functions and convexity. Mathematical programming: the state of the art","author":"Lov\u00e1sz L.","year":"1983","unstructured":"L. Lov\u00e1sz . Submodular functions and convexity. Mathematical programming: the state of the art , pages 235 -- 257 , 1983 . L. Lov\u00e1sz. Submodular functions and convexity. Mathematical programming: the state of the art, pages 235--257, 1983."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322337"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02784132"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9047-5"},{"key":"e_1_3_2_1_27_1","volume-title":"Aug.","author":"Raja A.","year":"2011","unstructured":"A. Raja and P. Viswanath . Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows Proc. of IEEE ISIT , Aug. 2011 . A. Raja and P. Viswanath. Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows Proc. of IEEE ISIT, Aug. 2011."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0031-x"},{"key":"e_1_3_2_1_29_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver A.","year":"2003","unstructured":"A. Schrijver . Combinatorial Optimization: Polyhedra and Efficiency . Springer-Verlag , 2003 . A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, 2003."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90011-X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2120250"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts","acronym":"ITCS '12"},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":30,"alternative-id":["10.1145\/2090236.2090268","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090268","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}