{"id":"https://openalex.org/W1560003866","doi":"https://doi.org/10.1145/2213977.2213979","title":"Faster approximate multicommodity flow using quadratically coupled flows","display_name":"Faster approximate multicommodity flow using quadratically coupled flows","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W1560003866","doi":"https://doi.org/10.1145/2213977.2213979","mag":"1560003866"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2213979","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2213979","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-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","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/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"]},{"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":true,"raw_author_name":"Jonathan A. Kelner","raw_affiliation_strings":["MIT, Boston, MA, USA","MIT, Boston, MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Boston, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Boston, MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010457003","display_name":"Gary L. Miller","orcid":"https://orcid.org/0000-0001-5456-8097"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gary L. Miller","raw_affiliation_strings":["CMU, Pittsburgh, PA, USA","CMU, pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"CMU, Pittsburgh, PA, USA","institution_ids":[]},{"raw_affiliation_string":"CMU, pittsburgh, PA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112534230","display_name":"Richard Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard Peng","raw_affiliation_strings":["CMU, Pittsburgh, PA, USA","CMU, pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"CMU, Pittsburgh, PA, USA","institution_ids":[]},{"raw_affiliation_string":"CMU, pittsburgh, PA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022068777"],"corresponding_institution_ids":["https://openalex.org/I4210110987","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.7066,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.92955457,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"18"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"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/T12288","display_name":"Optimization and Search Problems","score":0.9908999800682068,"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/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.9389781951904297},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6831245422363281},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6157413125038147},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6004789471626282},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5877335071563721},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5740333795547485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5400667190551758},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5122465491294861},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43339356780052185},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42057380080223083},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4184160828590393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3533366918563843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2904033660888672},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.25850909948349}],"concepts":[{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.9389781951904297},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6831245422363281},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6157413125038147},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6004789471626282},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5877335071563721},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5740333795547485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5400667190551758},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5122465491294861},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43339356780052185},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42057380080223083},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4184160828590393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3533366918563843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2904033660888672},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25850909948349},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2213979","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2213979","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-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1506342804","https://openalex.org/W1546004968","https://openalex.org/W1564124243","https://openalex.org/W1567885833","https://openalex.org/W1618148629","https://openalex.org/W1916091028","https://openalex.org/W1995547833","https://openalex.org/W2035144082","https://openalex.org/W2039303552","https://openalex.org/W2073647817","https://openalex.org/W2073772681","https://openalex.org/W2094383180","https://openalex.org/W2103370757","https://openalex.org/W2107884096","https://openalex.org/W2117595194","https://openalex.org/W2119717092","https://openalex.org/W2121902703","https://openalex.org/W2153441719","https://openalex.org/W2164853353","https://openalex.org/W2165956524","https://openalex.org/W2752885492","https://openalex.org/W3148602515","https://openalex.org/W4242767541","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W3161514703","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W1994440468","https://openalex.org/W2368069542","https://openalex.org/W4311255633"],"abstract_inverted_index":{"The":[0],"maximum":[1,11,105,110],"multicommodity":[2,25,61,112],"flow":[3,12,26,46,62,107,113],"problem":[4,13,27,108,114],"is":[5,30,70],"a":[6,20,31],"natural":[7],"generalization":[8],"of":[9,41,60],"the":[10,24,52,57,104],"to":[14,23,48,72,103],"route":[15],"multiple":[16],"distinct":[17],"flows.":[18],"Obtaining":[19],"1-\u03b5":[21,100],"approximation":[22],"on":[28],"graphs":[29],"well-studied":[32],"problem.":[33,50],"In":[34],"this":[35,49],"paper":[36],"we":[37,95],"present":[38],"an":[39,86],"adaptation":[40],"recent":[42],"advances":[43],"in":[44,56,115],"single-commodity":[45],"algorithms":[47,97],"As":[51],"underlying":[53],"linear":[54],"systems":[55,75],"electrical":[58],"problems":[59,63],"are":[64],"no":[65],"longer":[66],"Laplacians,":[67],"our":[68],"approach":[69],"tailored":[71],"generate":[73],"specialized":[74],"which":[76],"can":[77],"be":[78],"preconditioned":[79],"and":[80,92,109],"solved":[81],"efficiently":[82],"using":[83],"Laplacians.":[84],"Given":[85],"undirected":[87],"graph":[88],"with":[89],"m":[90],"edges":[91],"k":[93],"commodities,":[94],"give":[96],"that":[98],"find":[99],"approximate":[101],"solutions":[102],"concurrent":[106],"weighted":[111],"time":[116],"O(m4/3poly(k,\u03b5-1)).":[117]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}