{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:47Z","timestamp":1750306967672,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488704","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"755-764","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["A new approach to computing maximum flows using electrical flows"],"prefix":"10.1145","author":[{"given":"Yin Tat","family":"Lee","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satish","family":"Rao","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Srivastava","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.4086\/toc.2012.v008a006"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1007352.1007382"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1993636.1993674"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/060676386"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1374376.1374441"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.4153\/CJM-1956-045-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1806689.1806697"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.5555\/645899.672437"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/290179.290181"},{"key":"e_1_3_2_1_10_1","first-page":"490","volume-title":"SODA","author":"Karger David R.","year":"1998","unstructured":"David R. Karger . Better random sampling algorithms for flows in undirected graphs . In SODA , pages 490 -- 499 , 1998 . David R. Karger. Better random sampling algorithms for flows in undirected graphs. In SODA, pages 490--499, 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/509907.509918"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/FOCS.2011.85"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/645589.659777"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/s10107-004-0552-5"},{"key":"e_1_3_2_1_15_1","volume-title":"Optimization Software","author":"Poljak B.T.","year":"1987","unstructured":"B.T. Poljak . Introduction to optimization . Optimization Software , 1987 . B.T. Poljak. Introduction to optimization. Optimization Software, 1987."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1016\/0022-0000(83)90006-5"},{"unstructured":"Nisheeth Vishnoi. Lx=b book manuscript.  Nisheeth Vishnoi. Lx=b book manuscript.","key":"e_1_3_2_1_17_1"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC'13","name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA"},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488704","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:21Z","timestamp":1750235961000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":17,"alternative-id":["10.1145\/2488608.2488704","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488704","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}