{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T05:22:42Z","timestamp":1783401762173,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806708","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"121-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms"],"prefix":"10.1145","author":[{"given":"Aleksander","family":"Madry","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"USA","author":"Ahuja R. K.","year":"1993"},{"key":"e_1_3_2_1_2_1","unstructured":"S. Arora E. Hazan and S. Kale. The multiplicative weights update method: A meta-algorithm and applications. Available at http:\/\/www.cs.princeton.edu\/arora\/pubs\/MWsurvey.pdf.  S. Arora E. Hazan and S. Kale. The multiplicative weights update method: A meta-algorithm and applications. Available at http:\/\/www.cs.princeton.edu\/arora\/pubs\/MWsurvey.pdf."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90267-J"},{"key":"e_1_3_2_1_4_1","first-page":"394","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Baswana S.","year":"2003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.08.004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007382"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796544"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780567"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.005"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199355754"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796457"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90032-Q"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0804004"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592195"},{"key":"e_1_3_2_1_17_1","first-page":"166","volume-title":"Proceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms","author":"Karakostas G.","year":"2002"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225073"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792241175"},{"key":"e_1_3_2_1_20_1","first-page":"320","volume-title":"Proceedings of the 7th International IPCO Conference","author":"Klein P.","year":"2002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1020"},{"key":"e_1_3_2_1_22_1","unstructured":"A. Madry. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. arXiv:1003.5907. Available at http:\/\/arxiv.org\/abs\/1003.5907  A. Madry. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. arXiv:1003.5907. Available at http:\/\/arxiv.org\/abs\/1003.5907"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"e_1_3_2_1_24_1","volume-title":"The 20th International Symposium of Mathematical Programming","author":"Nesterov Y.","year":"2009"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/3219302.3219303"},{"key":"e_1_3_2_1_26_1","first-page":"486","volume-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Radzik T.","year":"1995"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652176"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.22"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007387"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_52"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77620"},{"key":"e_1_3_2_1_32_1","unstructured":"D. B. Shmoys. Cut problems and their application to divide-and-conquer. pages 192--235 1997.   D. B. Shmoys. Cut problems and their application to divide-and-conquer. pages 192--235 1997."},{"key":"e_1_3_2_1_33_1","first-page":"170","volume-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Young N. E.","year":"1995"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:36Z","timestamp":1750246776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":33,"alternative-id":["10.1145\/1806689.1806708","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806708","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}