{"id":"https://openalex.org/W2009281933","doi":"https://doi.org/10.1145/2488608.2488704","title":"A new approach to computing maximum flows using electrical flows","display_name":"A new approach to computing maximum flows using electrical flows","publication_year":2013,"publication_date":"2013-05-28","ids":{"openalex":"https://openalex.org/W2009281933","doi":"https://doi.org/10.1145/2488608.2488704","mag":"2009281933"},"language":"en","primary_location":{"id":"doi:10.1145/2488608.2488704","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024980585","display_name":"Yin Tat Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Tat Lee","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082369624","display_name":"Satish Rao","orcid":"https://orcid.org/0000-0002-7353-333X"},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":["UC Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103113924","display_name":"Nikhil Srivastava","orcid":"https://orcid.org/0000-0003-0768-9691"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Nikhil Srivastava","raw_affiliation_strings":["Microsoft Research, Bangalore, India","Microsoft Research, Bangalore, India#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research, Bangalore, India#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7193,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.9735783,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"755","last_page":"764"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6181084513664246},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5171584486961365},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5112695693969727},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49852657318115234},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4730728566646576},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4596753418445587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44255462288856506},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.4353076219558716},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41439101099967957},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41358286142349243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40914931893348694},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40079495310783386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36609143018722534}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6181084513664246},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5171584486961365},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5112695693969727},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49852657318115234},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4730728566646576},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4596753418445587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44255462288856506},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.4353076219558716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41439101099967957},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41358286142349243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40914931893348694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40079495310783386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36609143018722534},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2488608.2488704","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.376.3672","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.376.3672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/people/niksri/flow-camera.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W75740688","https://openalex.org/W1568288633","https://openalex.org/W1962291245","https://openalex.org/W2002531683","https://openalex.org/W2018804864","https://openalex.org/W2034841206","https://openalex.org/W2048382523","https://openalex.org/W2073647817","https://openalex.org/W2099463627","https://openalex.org/W2102560346","https://openalex.org/W2121210949","https://openalex.org/W2145192475","https://openalex.org/W2149841335","https://openalex.org/W2150865801","https://openalex.org/W2153441719","https://openalex.org/W2167732364","https://openalex.org/W2949556662","https://openalex.org/W4213060883","https://openalex.org/W4230854924"],"related_works":["https://openalex.org/W1906268133","https://openalex.org/W3107976745","https://openalex.org/W1543904360","https://openalex.org/W2049971620","https://openalex.org/W4230677477","https://openalex.org/W2118860231","https://openalex.org/W2028468530","https://openalex.org/W2419219947","https://openalex.org/W2085124875","https://openalex.org/W2091084079"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,11,164],"algorithm":[3,34,67,76,102,131],"which":[4,38,84],"computes":[5],"a":[6,44,61,142],"(1-\u03b5)-approximately":[7],"maximum":[8],"st-flow":[9],"in":[10,15,88,96,111],"undirected":[12,36],"uncapacitated":[13,51],"graph":[14,110],"time":[16,46,90],"O(1/\u03b5\u221am/F\u22c5":[17],"m":[18],"log2":[19],"n)":[20],"where":[21],"F":[22,158],"is":[23,132],"the":[24,32,54,66,78,106,109,125,145,160,168],"flow":[25,82,126],"value.":[26],"By":[27],"trading":[28],"this":[29],"off":[30],"against":[31],"Karger-Levine":[33],"for":[35,50],"graphs":[37],"takes":[39],"~O(m+nF)":[40],"time,":[41],"we":[42],"obtain":[43],"running":[45],"of":[47,63,68,108,147,154,156,167,170],"~O(m":[48],"n1/3/\u03b52/3)":[49],"graphs,":[52],"improving":[53],"previous":[55,99],"best":[56],"dependence":[57],"on":[58,127],"\u03b5":[59],"by":[60,163],"factor":[62],"O(1/\u03b53).":[64],"Like":[65],"Christiano,":[69],"Kelner,":[70],"Madry,":[71],"Spielman":[72],"and":[73,114,134,159],"Teng,":[74],"our":[75,101],"reduces":[77],"problem":[79],"to":[80,98,123,140,174],"electrical":[81,121],"computations":[83],"are":[85],"carried":[86],"out":[87],"linear":[89],"using":[91],"fast":[92],"Laplacian":[93],"solvers.":[94],"However,":[95],"contrast":[97],"work,":[100],"does":[103],"not":[104],"reweight":[105],"edges":[107],"any":[112],"way,":[113],"instead":[115],"uses":[116],"local":[117],"(i.e.,":[118],"non":[119],"s-t)":[120],"flows":[122],"reroute":[124],"congested":[128],"edges.":[129],"The":[130],"simple":[133],"may":[135],"be":[136],"viewed":[137],"as":[138],"trying":[139],"find":[141],"point":[143],"at":[144],"intersection":[146],"two":[148],"convex":[149],"sets":[150],"(the":[151],"affine":[152],"subspace":[153],"st-flows":[155],"value":[157],"l\u221e":[161],"ball)":[162],"accelerated":[165],"version":[166],"method":[169],"alternating":[171],"projections":[172],"due":[173],"Nesterov.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":22},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}