{"id":"https://openalex.org/W2153441719","doi":"https://doi.org/10.1145/1993636.1993674","title":"Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs","display_name":"Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2153441719","doi":"https://doi.org/10.1145/1993636.1993674","mag":"2153441719"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993674","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993674","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993674","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993674","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037736834","display_name":"Paul F. Christiano","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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Christiano","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022068777","display_name":"Jonathan A. Kelner","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan A. Kelner","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032574693","display_name":"Aleksander M\u0105dry","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aleksander Madry","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061644327","display_name":"Daniel A. Spielman","orcid":"https://orcid.org/0000-0002-8958-879X"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel A. Spielman","raw_affiliation_strings":["Yale University, New Haven, CT, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[{"id":"https://openalex.org/I1342924430","display_name":"LAC+USC Medical Center","ror":"https://ror.org/04xzj3x20","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1328359107","https://openalex.org/I1342924430"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shang-Hua Teng","raw_affiliation_strings":["USC, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"USC, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1342924430"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5037736834"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":24.5584,"has_fulltext":true,"cited_by_count":289,"citation_normalized_percentile":{"value":0.99787849,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"282"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7869170904159546},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5550079941749573},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5547241568565369},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.4854426980018616},{"id":"https://openalex.org/keywords/laplacian-matrix","display_name":"Laplacian matrix","score":0.48020753264427185},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4799092710018158},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4735671281814575},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4732549488544464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47159966826438904},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4570366144180298},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4473954439163208},{"id":"https://openalex.org/keywords/spectral-graph-theory","display_name":"Spectral graph theory","score":0.4414014220237732},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.41389235854148865},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39471736550331116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3494030833244324},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2136247456073761},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.15405869483947754},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14390406012535095},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12578237056732178}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7869170904159546},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5550079941749573},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5547241568565369},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.4854426980018616},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.48020753264427185},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4799092710018158},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4735671281814575},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4732549488544464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47159966826438904},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4570366144180298},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4473954439163208},{"id":"https://openalex.org/C74003402","wikidata":"https://www.wikidata.org/wiki/Q3180727","display_name":"Spectral graph theory","level":5,"score":0.4414014220237732},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.41389235854148865},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39471736550331116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3494030833244324},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2136247456073761},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.15405869483947754},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14390406012535095},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12578237056732178},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1993636.1993674","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993674","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993674","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.3908","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.3908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madry/docs/maxflow.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.1402","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.1402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://math.mit.edu/%7Ekelner/Publications/Docs/maxFlow.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.750.2809","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.750.2809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1010.2921.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/71698","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/71698","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993674","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993674","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993674","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2735267692","display_name":"Collaborative Research: Spectral Graph Theory and Its Applications","funder_award_id":"1032367","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6398359638","display_name":null,"funder_award_id":"N00014-11-1-0053","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6759497661","display_name":null,"funder_award_id":"0843915","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7804582490","display_name":"AF: Small: Spectral Graph Theory, Point Clouds, and Linear Equation Solvers","funder_award_id":"0915487","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G955871416","display_name":"Polyhedral Techniques for the Design of Approximation Algorithms","funder_award_id":"0829878","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2153441719.pdf","grobid_xml":"https://content.openalex.org/works/W2153441719.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1515029502","https://openalex.org/W1543491698","https://openalex.org/W1560003866","https://openalex.org/W1618148629","https://openalex.org/W1916091028","https://openalex.org/W1936317424","https://openalex.org/W1977545325","https://openalex.org/W2002272911","https://openalex.org/W2002531683","https://openalex.org/W2004308928","https://openalex.org/W2008292658","https://openalex.org/W2034841206","https://openalex.org/W2045107949","https://openalex.org/W2051540665","https://openalex.org/W2066308383","https://openalex.org/W2072142932","https://openalex.org/W2073647817","https://openalex.org/W2099463627","https://openalex.org/W2102560346","https://openalex.org/W2117595194","https://openalex.org/W2134422938","https://openalex.org/W2148025043","https://openalex.org/W2150865801","https://openalex.org/W2153441719","https://openalex.org/W2154501376","https://openalex.org/W2163656645","https://openalex.org/W2164853353","https://openalex.org/W2165956524","https://openalex.org/W2167732364","https://openalex.org/W2338905098","https://openalex.org/W2340149117","https://openalex.org/W2949396974","https://openalex.org/W2950016820","https://openalex.org/W4237496336","https://openalex.org/W6703734804"],"related_works":["https://openalex.org/W2590727506","https://openalex.org/W2121204510","https://openalex.org/W2095284441","https://openalex.org/W3155269421","https://openalex.org/W3141688457","https://openalex.org/W3141113327","https://openalex.org/W2401819591","https://openalex.org/W647071796","https://openalex.org/W2141353198","https://openalex.org/W2186707160"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,13,23,38,44,72,83,104],"new":[3],"approach":[4,96],"to":[5,137],"computing":[6,66,103],"an":[7],"approximately":[8,51,67,139,147],"maximum":[9,68,85,140],"s-t":[10,69,86,107,141,149],"flow":[11,18,27,31,87],"in":[12,43,53,88,143,151],"capacitated,":[14],"undirected":[15],"graph.":[16],"This":[17],"is":[19,32],"computed":[20,52],"by":[21,34,123],"solving":[22],"sequence":[24],"of":[25,37,40,94,126],"electrical":[26,30],"problems.":[28],"Each":[29],"given":[33],"the":[35,61,98,114,124],"solution":[36],"system":[39],"linear":[41],"equations":[42],"Laplacian":[45],"matrix,":[46],"and":[47,77,119,128,146],"thus":[48],"may":[49],"be":[50,135],"nearly-linear":[54],"time.":[55,112],"Using":[56],"this":[57],"approach,":[58],"we":[59],"develop":[60],"fastest":[62,99],"known":[63,100],"algorithm":[64,81,101,125],"for":[65,102],"flows.":[70],"For":[71],"graph":[73],"having":[74],"n":[75,120],"vertices":[76],"m":[78,118],"edges,":[79],"our":[80,95],"computes":[82],"(1-\u03b5)-approximately":[84],"time":[89,144,152],"~O(mn1/3\u03b5-11/3).":[90],"A":[91],"dual":[92],"version":[93],"gives":[97],"(1+\u03b5)-approximately":[105],"minimum":[106,148],"cut.":[108],"It":[109],"takes":[110],"~O(m+n4/3\u03b5-16/3)":[111],"Previously,":[113],"best":[115],"dependence":[116],"on":[117],"was":[121],"achieved":[122],"Goldberg":[127],"Rao":[129],"(J.":[130],"ACM":[131],"1998),":[132],"which":[133],"can":[134],"used":[136],"compute":[138],"flows":[142],"~O({m\u221an\u03b5-1),":[145],"cuts":[150],"~O(m+n3/2\u03b5-3).":[153]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":37},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":39},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":29},{"year":2012,"cited_by_count":14}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}