{"id":"https://openalex.org/W2146409551","doi":"https://doi.org/10.1137/070705994","title":"Fast Augmenting Paths by Random Sampling from Residual Graphs","display_name":"Fast Augmenting Paths by Random Sampling from Residual Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2146409551","doi":"https://doi.org/10.1137/070705994","mag":"2146409551"},"language":"en","primary_location":{"id":"doi:10.1137/070705994","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070705994","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[{"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":"David R. Karger","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technol-ogy, Cambridge MA 02139"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technol-ogy, Cambridge MA 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063825225","display_name":"Matthew S. Levine","orcid":"https://orcid.org/0000-0002-2622-2678"},"institutions":[{"id":"https://openalex.org/I10734018","display_name":"Akamai (United States)","ror":"https://ror.org/03tarb191","country_code":"US","type":"company","lineage":["https://openalex.org/I10734018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew S. Levine","raw_affiliation_strings":["Akamai Technologies,"],"affiliations":[{"raw_affiliation_string":"Akamai Technologies,","institution_ids":["https://openalex.org/I10734018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.0915,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.80016943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"44","issue":"2","first_page":"320","last_page":"339"},"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.9993000030517578,"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.9993000030517578,"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/T11106","display_name":"Data Management and Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.6947328448295593},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6943884491920471},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6304965019226074},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5332227349281311},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5297732353210449},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5282788872718811},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5060142874717712},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.4861571490764618},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47682303190231323},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4388643503189087},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4378373622894287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4195929169654846},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28476592898368835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16506972908973694},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08585727214813232}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6947328448295593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6943884491920471},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6304965019226074},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5332227349281311},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5297732353210449},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5282788872718811},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5060142874717712},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.4861571490764618},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47682303190231323},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4388643503189087},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4378373622894287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4195929169654846},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28476592898368835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16506972908973694},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08585727214813232},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070705994","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070705994","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1543491698","https://openalex.org/W1996575062","https://openalex.org/W2008292658","https://openalex.org/W2014682451","https://openalex.org/W2042587503","https://openalex.org/W2099463627","https://openalex.org/W2115049345","https://openalex.org/W2150516767","https://openalex.org/W2168919539","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2560215812","https://openalex.org/W2949601986","https://openalex.org/W2788972299","https://openalex.org/W2521347458","https://openalex.org/W2498789492","https://openalex.org/W2729981612","https://openalex.org/W1490360359","https://openalex.org/W3190612612","https://openalex.org/W2012334499","https://openalex.org/W4231283508"],"abstract_inverted_index":{"Consider":[0],"an":[1,41,75],"$n$-vertex,":[2],"$m$-edge,":[3],"undirected":[4],"graph":[5],"with":[6],"integral":[7],"capacities":[8],"and":[9],"max-flow":[10],"value":[11,87],"$v$.":[12],"We":[13,71],"give":[14],"a":[15,45,84],"new":[16],"$\\tilde{O}(m":[17],"+":[18],"nv)$-time":[19],"maximum":[20,91],"flow":[21,85],"algorithm.":[22],"After":[23],"assigning":[24],"certain":[25],"special":[26],"sampling":[27,66],"probabilities":[28],"to":[29],"edges":[30,49],"in":[31,44,92],"$\\tilde{O}(m)$":[32],"time,":[33],"our":[34],"algorithm":[35,76],"is":[36],"very":[37],"simple:":[38],"repeatedly":[39],"find":[40],"augmenting":[42],"path":[43],"random":[46,65],"sample":[47],"of":[48,80,86],"from":[50,55,67],"the":[51,90],"residual":[52],"graph.":[53],"Breaking":[54],"past":[56],"work,":[57],"we":[58,61],"demonstrate":[59],"that":[60],"can":[62],"benefit":[63],"by":[64],"directed":[68],"(residual)":[69],"graphs.":[70],"also":[72],"slightly":[73],"improve":[74],"for":[77],"approximating":[78],"flows":[79],"arbitrary":[81],"value,":[82],"finding":[83],"$(1-\\epsilon)$":[88],"times":[89],"$\\tilde{O}(m\\sqrt{n/\\epsilon})$":[93],"time.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}