{"id":"https://openalex.org/W2953292048","doi":"https://doi.org/10.1145/3383454","title":"A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization","display_name":"A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization","publication_year":2020,"publication_date":"2020-04-17","ids":{"openalex":"https://openalex.org/W2953292048","doi":"https://doi.org/10.1145/3383454","mag":"2953292048"},"language":"en","primary_location":{"id":"doi:10.1145/3383454","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3383454","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"preprint","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://eprints.lse.ac.uk/103370/1/strongly_polynomial_arxiv.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071590414","display_name":"Neil Olver","orcid":"https://orcid.org/0000-0001-8897-5459"},"institutions":[{"id":"https://openalex.org/I909854389","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I909854389"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["GB","NL"],"is_corresponding":true,"raw_author_name":"Neil Olver","raw_affiliation_strings":["London School of Economics and Political Science, United Kingdom and CWI, The Netherlands","London  School of Economics"],"affiliations":[{"raw_affiliation_string":"London School of Economics and Political Science, United Kingdom and CWI, The Netherlands","institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I909854389"]},{"raw_affiliation_string":"London  School of Economics","institution_ids":["https://openalex.org/I909854389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049428164","display_name":"L\u00e1szl\u00f3 A. V\u00e9gh","orcid":"https://orcid.org/0000-0003-1152-200X"},"institutions":[{"id":"https://openalex.org/I909854389","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I909854389"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"L\u00e1szl\u00f3 A. V\u00e9gh","raw_affiliation_strings":["London School of Economics and Political Science, London, United Kingdom","London  School of Economics"],"affiliations":[{"raw_affiliation_string":"London School of Economics and Political Science, London, United Kingdom","institution_ids":["https://openalex.org/I909854389"]},{"raw_affiliation_string":"London  School of Economics","institution_ids":["https://openalex.org/I909854389"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071590414"],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I909854389"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02135124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"67","issue":"2","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9894999861717224,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9894999861717224,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9842000007629395,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9635000228881836,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"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/maximization","display_name":"Maximization","score":0.7054345607757568},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6176034212112427},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5986543297767639},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5681532621383667},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5212241411209106},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48445963859558105},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.48316115140914917},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4735528528690338},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4584999978542328},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.4175727367401123},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35197311639785767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34985262155532837},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.32166391611099243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23694151639938354},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06860128045082092},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05336150527000427}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7054345607757568},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6176034212112427},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5986543297767639},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5681532621383667},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5212241411209106},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48445963859558105},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.48316115140914917},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4735528528690338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4584999978542328},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.4175727367401123},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35197311639785767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34985262155532837},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32166391611099243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23694151639938354},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06860128045082092},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05336150527000427},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/3383454","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3383454","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:eprints.lse.ac.uk:103370","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-8897-5459>","pdf_url":"http://eprints.lse.ac.uk/103370/1/strongly_polynomial_arxiv.pdf","source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"mag:2953292048","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1611.01778.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:eprints.lse.ac.uk:103086","is_oa":false,"landing_page_url":"http://eprints.lse.ac.uk/103086/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:eprints.lse.ac.uk:103177","is_oa":false,"landing_page_url":"http://acm-stoc.org/stoc2017/toc.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/5542a90e-8b1c-4bce-86ca-8e024e190dce","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/5542a90e-8b1c-4bce-86ca-8e024e190dce","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Olver , N K & V\u00e9gh , L 2017 , A simpler and faster strongly polynomial algorithm for generalized flow maximization . in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC) . ACM , pp. 100-111 . https://doi.org/10.1145/3055399.3055439","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research.vu.nl:publications/5542a90e-8b1c-4bce-86ca-8e024e190dce","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/5542a90e-8b1c-4bce-86ca-8e024e190dce","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Olver , N K & V\u00e9gh , L 2017 , A simpler and faster strongly polynomial algorithm for generalized flow maximization . in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC) . ACM , pp. 100-111 . https://doi.org/10.1145/3055399.3055439","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.1611.01778","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1611.01778","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:eprints.lse.ac.uk:103370","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-8897-5459>","pdf_url":"http://eprints.lse.ac.uk/103370/1/strongly_polynomial_arxiv.pdf","source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1637932959","display_name":null,"funder_award_id":"EP/M02797X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G211972097","display_name":"New strongly polynomial algorithms for network optimisation problems","funder_award_id":"EP/M02797X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3822032872","display_name":null,"funder_award_id":"016.Vidi.189.087","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G4623480208","display_name":null,"funder_award_id":"NWO Vidi","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8452545418","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8654818507","display_name":null,"funder_award_id":"Mathematics","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2953292048.pdf","grobid_xml":"https://content.openalex.org/works/W2953292048.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W53596869","https://openalex.org/W115034524","https://openalex.org/W1506071578","https://openalex.org/W1976073775","https://openalex.org/W1977545325","https://openalex.org/W2002636386","https://openalex.org/W2019609597","https://openalex.org/W2032938251","https://openalex.org/W2035144082","https://openalex.org/W2041444488","https://openalex.org/W2044413922","https://openalex.org/W2048138541","https://openalex.org/W2048441979","https://openalex.org/W2048790997","https://openalex.org/W2050789657","https://openalex.org/W2059630705","https://openalex.org/W2059969305","https://openalex.org/W2071419879","https://openalex.org/W2073647817","https://openalex.org/W2084224084","https://openalex.org/W2084990336","https://openalex.org/W2089403144","https://openalex.org/W2103985627","https://openalex.org/W2118504961","https://openalex.org/W2127470768","https://openalex.org/W2144532599","https://openalex.org/W2149342630","https://openalex.org/W2150154671","https://openalex.org/W2150492728","https://openalex.org/W2155523822","https://openalex.org/W2156036190","https://openalex.org/W2514746546","https://openalex.org/W2524112391","https://openalex.org/W2570927197","https://openalex.org/W3139414591"],"related_works":["https://openalex.org/W3021764208","https://openalex.org/W2250161982","https://openalex.org/W1886770168","https://openalex.org/W3160876770","https://openalex.org/W2073647817","https://openalex.org/W2809347089","https://openalex.org/W3016974081","https://openalex.org/W2101087512","https://openalex.org/W2133676097","https://openalex.org/W3095646251","https://openalex.org/W2964317125","https://openalex.org/W2886596322","https://openalex.org/W2978538948","https://openalex.org/W3046563104","https://openalex.org/W2417394769","https://openalex.org/W1613953984","https://openalex.org/W2963115142","https://openalex.org/W2167495088","https://openalex.org/W796181159","https://openalex.org/W3095902030"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,55],"new":[3,82],"strongly":[4,20],"polynomial":[5,21,78],"algorithm":[6,22],"for":[7,63,107],"generalized":[8],"flow":[9],"maximization":[10],"that":[11],"is":[12,72,85],"significantly":[13],"simpler":[14],"and":[15],"faster":[16],"than":[17],"the":[18,25,29,50,75,87,108],"previous":[19,51,105],"[34].":[23],"For":[24],"uncapacitated":[26],"problem":[27],"formulation,":[28],"complexity":[30],"bound":[31,71],"O":[32,57],"(":[33,35,42,58],"mn":[34],"m":[36,46],"+":[37],"n":[38,40,43,59],"log":[39],")log":[41],"2":[44,60],"/":[45],"))":[47],"improves":[48],"on":[49],"estimate":[52],"by":[53],"almost":[54,96],"factor":[56],").":[61],"Even":[62],"small":[64],"numerical":[65],"parameter":[66],"values,":[67],"our":[68],"running":[69],"time":[70],"comparable":[73],"to":[74,94,103],"best":[76],"weakly":[77],"algorithms.":[79],"The":[80],"key":[81],"technical":[83],"idea":[84],"relaxing":[86],"primal":[88],"feasibility":[89],"conditions.":[90],"This":[91],"allows":[92],"us":[93],"work":[95],"exclusively":[97],"with":[98],"integral":[99],"flows,":[100],"in":[101],"contrast":[102],"all":[104],"algorithms":[106],"problem.":[109]},"counts_by_year":[],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}