{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:56:30Z","timestamp":1767034590656,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007432","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"529-538","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["(Almost) tight bounds and existence theorems for confluent flows"],"prefix":"10.1145","author":[{"given":"Jiangzhuo","family":"Chen","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA"}]},{"given":"Robert D.","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}]},{"given":"L\u00e1szl\u00f3","family":"Lov\u00e1sz","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, Quebec, Canada"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780598"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796455"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237977"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_1_5_1","volume-title":"Flows in Networks","author":"Ford L.","year":"1962","unstructured":"L. Ford , Jr. and D. Fulkerson . Flows in Networks . Princeton University Press , Princeton, NJ , 1962 . L. Ford, Jr. and D. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380830"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00066-7"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the Fifth Hungarian Combinatorial Colloquium","author":"Gy\u00f6ri E.","year":"1976","unstructured":"E. Gy\u00f6ri . On division of graphs to connected subgraphs . In Proceedings of the Fifth Hungarian Combinatorial Colloquium , Budapest , 1976 . E. Gy\u00f6ri. On division of graphs to connected subgraphs. In Proceedings of the Fifth Hungarian Combinatorial Colloquium, Budapest, 1976."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90044-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875508"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383070"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01896190"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of IEEE INFOCOM","author":"Wang J.","year":"2002","unstructured":"J. Wang and K. Nahrstedt . Hop-by-hop routing algorithms for premium-class traffic in diffserv networks . In Proceedings of IEEE INFOCOM , New York, NY , June 2002 . J. Wang and K. Nahrstedt. Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. In Proceedings of IEEE INFOCOM, New York, NY, June 2002."}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC04"},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007432","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:56Z","timestamp":1750267436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":15,"alternative-id":["10.1145\/1007352.1007432","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007432","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}