{"id":"https://openalex.org/W2107881198","doi":"https://doi.org/10.1137/s0097539794285983","title":"An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm","display_name":"An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm","publication_year":1998,"publication_date":"1998-02-01","ids":{"openalex":"https://openalex.org/W2107881198","doi":"https://doi.org/10.1137/s0097539794285983","mag":"2107881198"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794285983","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794285983","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/A5052726191","display_name":"Yonatan Aumann","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yonatan Aumann","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010842984","display_name":"Yuval Rabani","orcid":"https://orcid.org/0000-0001-7772-2544"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Rabani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052726191"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0854,"has_fulltext":false,"cited_by_count":264,"citation_normalized_percentile":{"value":0.95928665,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"27","issue":"1","first_page":"291","last_page":"301"},"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.9994999766349792,"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.9994999766349792,"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.9991999864578247,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6829283833503723},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6557027697563171},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6426160335540771},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6155849099159241},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5995025634765625},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5663134455680847},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5185609459877014},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.48115479946136475},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.45218297839164734},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4518640637397766},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43858370184898376},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38938531279563904},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3317769765853882},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13475412130355835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12531721591949463},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09599035978317261}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6829283833503723},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6557027697563171},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6426160335540771},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6155849099159241},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5995025634765625},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5663134455680847},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5185609459877014},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.48115479946136475},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.45218297839164734},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4518640637397766},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43858370184898376},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38938531279563904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3317769765853882},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13475412130355835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12531721591949463},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09599035978317261},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539794285983","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794285983","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":[{"display_name":"Decent work and economic growth","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W59573364","https://openalex.org/W1480903797","https://openalex.org/W1489650731","https://openalex.org/W1524804355","https://openalex.org/W1530572757","https://openalex.org/W1563039933","https://openalex.org/W1593787329","https://openalex.org/W1963501983","https://openalex.org/W1985284097","https://openalex.org/W2002531683","https://openalex.org/W2011039300","https://openalex.org/W2017713020","https://openalex.org/W2035652501","https://openalex.org/W2042899161","https://openalex.org/W2059742977","https://openalex.org/W2063491776","https://openalex.org/W2069702698","https://openalex.org/W2069816168","https://openalex.org/W2080905757","https://openalex.org/W2085035171","https://openalex.org/W2113227678","https://openalex.org/W2117319425","https://openalex.org/W2121902703","https://openalex.org/W2122308034","https://openalex.org/W2125278290","https://openalex.org/W2150815458","https://openalex.org/W2154501376","https://openalex.org/W2176446742","https://openalex.org/W2521038442","https://openalex.org/W2599168675","https://openalex.org/W2610755752","https://openalex.org/W2917997019","https://openalex.org/W4210485603","https://openalex.org/W4213060883","https://openalex.org/W4242767541","https://openalex.org/W4285719527"],"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":{"It":[0],"is":[1,8,40,74],"shown":[2],"that":[3],"the":[4,16,32,63,70],"minimum":[5],"cut":[6,53],"ratio":[7,55],"within":[9,56],"a":[10,45,52,57],"factor":[11,58],"of":[12,15,36,59,62,69],"O(log":[13,60],"k)":[14,61],"maximum":[17,64],"concurrent":[18,65],"flow":[19,22],"for":[20,50],"k-commodity":[21],"instances":[23],"with":[24,54],"arbitrary":[25],"capacities":[26],"and":[27,39,67],"demands.":[28],"This":[29],"improves":[30],"upon":[31],"previously":[33],"best-known":[34],"bound":[35],"O(log2k":[37],")":[38],"existentially":[41],"tight,":[42],"up":[43],"to":[44],"constant":[46],"factor.":[47],"An":[48],"algorithm":[49],"finding":[51],"flow,":[66],"thus":[68],"optimal":[71],"min-cut":[72],"ratio,":[73],"presented.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":17}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}