{"id":"https://openalex.org/W1543491698","doi":"https://doi.org/10.1137/070705970","title":"Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs","display_name":"Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1543491698","doi":"https://doi.org/10.1137/070705970","mag":"1543491698"},"language":"en","primary_location":{"id":"doi:10.1137/070705970","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070705970","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/A5021452458","display_name":"Andr\u00e1s A. Bencz\u00far","orcid":"https://orcid.org/0000-0002-9392-0986"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Andr\u00e1s A. Bencz\u00far","raw_affiliation_strings":["Hungarian Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Hungarian Academy of Sciences","institution_ids":["https://openalex.org/I7597260"]}]},{"author_position":"last","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":false,"raw_author_name":"David R. Karger","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021452458"],"corresponding_institution_ids":["https://openalex.org/I7597260"],"apc_list":null,"apc_paid":null,"fwci":7.277,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.97518276,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"44","issue":"2","first_page":"290","last_page":"319"},"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.9142000079154968,"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.9142000079154968,"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.019500000402331352,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.015399999916553497,"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/combinatorics","display_name":"Combinatorics","score":0.7207081317901611},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.710455060005188},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6658611297607422},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6135594844818115},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4925997853279114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4913005232810974},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4781690239906311},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47658631205558777},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4419924020767212},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.440665066242218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23046362400054932}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7207081317901611},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.710455060005188},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6658611297607422},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6135594844818115},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4925997853279114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4913005232810974},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4781690239906311},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47658631205558777},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4419924020767212},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.440665066242218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23046362400054932}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/070705970","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070705970","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.332.5407","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.5407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cc.gatech.edu/fac/Milena.Mihail/D.7520reading/7520kargerflow1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.8422","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.8422","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/karger/Papers/stcut-journal.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.sztaki.hu:8545","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/8545/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1496921672","https://openalex.org/W1513400187","https://openalex.org/W1927738121","https://openalex.org/W1964510837","https://openalex.org/W1968256394","https://openalex.org/W1971680255","https://openalex.org/W1977545325","https://openalex.org/W1978099551","https://openalex.org/W1983193888","https://openalex.org/W1996575062","https://openalex.org/W2002531683","https://openalex.org/W2014682451","https://openalex.org/W2019040312","https://openalex.org/W2034331023","https://openalex.org/W2034841206","https://openalex.org/W2035228443","https://openalex.org/W2042587503","https://openalex.org/W2067081844","https://openalex.org/W2090359754","https://openalex.org/W2099463627","https://openalex.org/W2103012681","https://openalex.org/W2103444054","https://openalex.org/W2109260999","https://openalex.org/W2130891992","https://openalex.org/W2146409551","https://openalex.org/W2150516767","https://openalex.org/W2153441719","https://openalex.org/W2168256531","https://openalex.org/W2168919539","https://openalex.org/W2169871260","https://openalex.org/W2175029980","https://openalex.org/W2295428206","https://openalex.org/W2751862591","https://openalex.org/W2752885492","https://openalex.org/W4213060883","https://openalex.org/W4233413206"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W3141688457","https://openalex.org/W2078695342","https://openalex.org/W1974018476","https://openalex.org/W2095284441","https://openalex.org/W2121204510","https://openalex.org/W2590727506","https://openalex.org/W3155269421","https://openalex.org/W1572441411"],"abstract_inverted_index":{"We":[0,16],"describe":[1],"random":[2,148],"sampling":[3],"techniques":[4],"for":[5,54],"approximately":[6,42,100],"solving":[7],"problems":[8],"that":[9,23],"involve":[10],"cuts":[11,40],"and":[12,66,126,133,162],"flows":[13],"in":[14,74,85,103],"graphs.":[15],"give":[17],"a":[18,80,94,141],"near-linear-time":[19],"randomized":[20,95],"combinatorial":[21],"construction":[22],"transforms":[24],"any":[25],"graph":[26,34,163],"on":[27,35,140,159],"$n$":[28],"vertices":[29,38],"into":[30],"an":[31,70,99],"$O(n\\log":[32],"n)$-edge":[33],"the":[36,43,47,59,86,114,145],"same":[37,44],"whose":[39],"have":[41],"value":[45],"as":[46],"original":[48,87],"graph's.":[49],"In":[50],"this":[51],"new":[52],"graph,":[53],"example,":[55],"we":[56],"can":[57,108],"run":[58],"$\\tilde{O}(m^{3/2})$-time":[60],"maximum":[61,101],"flow":[62,102,134],"algorithm":[63,97,107],"of":[64,117,147],"Goldberg":[65],"Rao":[67],"to":[68,79,93,112,124,127],"find":[69],"$s$-$t$":[71,83],"minimum":[72,82],"cut":[73,84,119,132,150],"$\\tilde{O}(n^{3/2})$":[75],"time.":[76,105],"This":[77],"corresponds":[78],"$(1+\\epsilon)$-times":[81],"graph.":[88],"A":[89],"related":[90],"approach":[91],"leads":[92],"divide-and-conquer":[96],"producing":[98],"$\\tilde{O}(m\\sqrt{n})$":[104],"Our":[106,136,155],"also":[109],"be":[110],"used":[111],"improve":[113],"running":[115],"time":[116],"sparsest":[118],"approximation":[120],"algorithms":[121,137],"from":[122],"$\\tilde{O}(mn)$":[123],"$\\tilde{O}(n^2)$":[125],"accelerate":[128],"several":[129],"other":[130],"recent":[131],"algorithms.":[135],"are":[138],"based":[139],"general":[142],"theorem":[143],"analyzing":[144],"concentration":[146],"graphs'":[149],"values":[151],"near":[152],"their":[153],"expectations.":[154],"work":[156],"draws":[157],"only":[158],"elementary":[160],"probability":[161],"theory.":[164]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}