{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:00Z","timestamp":1750307040843,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2213980","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"19-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["When the cut condition is enough"],"prefix":"10.1145","author":[{"given":"Amit","family":"Chakrabarti","sequence":"first","affiliation":[{"name":"Dartmouth College, Hanover, NH, USA"}]},{"given":"Lisa","family":"Fleischer","sequence":"additional","affiliation":[{"name":"Dartmouth College, Hanover, NH, USA"}]},{"given":"Christophe","family":"Weibel","sequence":"additional","affiliation":[{"name":"Dartmouth College, Hanover, NH, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.79"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"C. Chekuri B. Shepherd and C. Weibel. Flow-cut gaps for integer and fractional multiflows. Submitted to the Journal of Computational Theory Series B; available at arXiv:1008.2136v1 July 2010.   C. Chekuri B. Shepherd and C. Weibel. Flow-cut gaps for integer and fractional multiflows. Submitted to the Journal of Computational Theory Series B; available at arXiv:1008.2136v1 July 2010.","DOI":"10.1137\/1.9781611973075.96"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873697"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010138917X"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0015-x"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.344"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_17"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_2_10_1","first-page":"577","article-title":"The geometry of graphs and some of its algorithmic applications","volume":"15","author":"Linial N.","year":"1994","journal-title":"Combinatorica"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90004-6"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00223-2"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90100-2"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80012-3"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320191"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125349"},{"key":"e_1_3_2_2_17_1","unstructured":"A.\n       \n      Schrijver\n    .\n      \n  \n   \n  Combinatorial Optimization: Polyhedra and Efficieny volume \n  24\n   of \n  Algorithms and Combinatorics\n  . \n  Springer-Verlag New York 2003\n  .  A. Schrijver. Combinatorial Optimization: Polyhedra and Efficieny volume 24 of Algorithms and Combinatorics. Springer-Verlag New York 2003."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(81)80033-9"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-42.1.178"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213980","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2213980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213980"}},"subtitle":["a complete characterization for multiflow problems in series-parallel networks"],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":19,"alternative-id":["10.1145\/2213977.2213980","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2213980","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}