{"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":1750307040409,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"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.2214040","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"689-708","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms and hardness of integral concurrent flow"],"prefix":"10.1145","author":[{"given":"Parinya","family":"Chalermsook","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}]},{"given":"Julia","family":"Chuzhoy","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute, Chicago, IL, USA"}]},{"given":"Alina","family":"Ene","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, Urbana, IL, USA"}]},{"given":"Shi","family":"Li","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, 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.1109\/FOCS.2010.33"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2455-9"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060632"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/050636899"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007383"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060618"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a007"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214054"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183907.1183908"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00022-1"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793243016"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Naveen\n      Garg Vijay V.\n      Vazirani and \n      Mihalis\n      Yannakakis\n    .\n  Primal-dual approximation algorithms for integral flow and multicut in trees with applications to matching and set cover\n  . In Andrzej Lingas Rolf G. Karlsson and Svante Carlsson editors ICALP volume \n  700\n   of \n  Lecture Notes in Computer Science pages \n  64\n  --\n  75\n  . \n  Springer 1993\n  .   Naveen Garg Vijay V. Vazirani and Mihalis Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees with applications to matching and set cover. In Andrzej Lingas Rolf G. Karlsson and Svante Carlsson editors ICALP volume 700 of Lecture Notes in Computer Science pages 64--75. Springer 1993.","DOI":"10.1007\/3-540-56939-1_62"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.2.383"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365733"},{"key":"e_1_3_2_2_22_1","first-page":"43","volume-title":"In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Harald","year":"2002","unstructured":"Harald R\\\"acke. Minimizing congestion in general networks . In In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS) , pages 43 -- 52 , 2002 . Harald R\\\"acke. Minimizing congestion in general networks. In In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 43--52, 2002."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/080715093"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_2_26_1","volume-title":"Paths, Flows and VLSI-Layout","author":"Robertson N.","year":"1990","unstructured":"N. Robertson and P. D. Seymour . Outline of a disjoint paths algorithm . In Paths, Flows and VLSI-Layout . Springer-Verlag , 1990 . N. Robertson and P. D. Seymour. Outline of a disjoint paths algorithm. In Paths, Flows and VLSI-Layout. Springer-Verlag, 1990."}],"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.2214040","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214040","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.2214040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":26,"alternative-id":["10.1145\/2213977.2214040","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214040","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"}}]}}