{"id":"https://openalex.org/W2140097884","doi":"https://doi.org/10.1137/s0097539792236717","title":"Approximate Max-Flow on Small Depth Networks","display_name":"Approximate Max-Flow on Small Depth Networks","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2140097884","doi":"https://doi.org/10.1137/s0097539792236717","mag":"2140097884"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792236717","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236717","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/A5026385549","display_name":"Edith Cohen","orcid":"https://orcid.org/0000-0002-3926-8237"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Edith Cohen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026385549"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.23566047,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":"3","first_page":"579","last_page":"597"},"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.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7790770530700684},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7176154255867004},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7091971635818481},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6944483518600464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6639298796653748},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6516172885894775},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6343557834625244},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6121704578399658},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5420175194740295},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5246679782867432},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4313640594482422},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37537211179733276},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3702136278152466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1967642605304718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11369386315345764},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0841546356678009}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7790770530700684},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7176154255867004},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7091971635818481},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6944483518600464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6639298796653748},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6516172885894775},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6343557834625244},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6121704578399658},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5420175194740295},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5246679782867432},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4313640594482422},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37537211179733276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3702136278152466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1967642605304718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11369386315345764},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0841546356678009},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792236717","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236717","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1584086289","https://openalex.org/W1979740015","https://openalex.org/W1998375300","https://openalex.org/W2007470648","https://openalex.org/W2008292658","https://openalex.org/W2016715486","https://openalex.org/W2040699536","https://openalex.org/W2046043928","https://openalex.org/W2057059776","https://openalex.org/W2059378738","https://openalex.org/W2061872629","https://openalex.org/W2089828587","https://openalex.org/W2090359754","https://openalex.org/W2109567578","https://openalex.org/W2157529519","https://openalex.org/W2610479830","https://openalex.org/W2610729871"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W2543175834","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327"],"abstract_inverted_index":{"We":[0,105],"consider":[1],"the":[2,17,31,46,98,148],"maximum":[3,47,99],"flow":[4,38,123,153],"problem":[5,33],"on":[6,111,154],"directed":[7],"acyclic":[8],"networks":[9,169],"with":[10,157,170],"m":[11],"edges":[12],"and":[13,53,64],"depthr":[14],"(length":[15],"of":[16,34,39,45,93,97,139],"longest":[18],"s-t":[19,37],"path).":[20],"Our":[21],"main":[22],"result":[23],"is":[24,61,70,138],"a":[25,71,90,107,134,155],"new":[26],"deterministic":[27],"algorithm":[28,60,87,136,149],"for":[29],"solving":[30],"relaxed":[32],"computing":[35],"an":[36,83,161],"value":[40],"at":[41],"least":[42],"$(1-":[43,95],"\\epsilon)$":[44,96],"flow.":[48,163],"For":[49,129],"instances":[50],"when":[51,125],"r":[52],"$\\epsilon^{-1}$":[54],"are":[55,127],"small":[56],"(i.e.,":[57],"$O(\\operatorname{polylog}(m))$),":[58],"this":[59,130],"in":[62,117],"$\\mathcal{N}\\mathcal{C}$":[63],"uses":[65],"only":[66],"$O(m)$":[67,146],"processors,":[68,147],"which":[69],"significant":[72],"improvement":[73],"over":[74],"existing":[75],"parallel":[76],"algorithms.":[77],"As":[78],"one":[79],"consequence,":[80],"we":[81,132],"obtain":[82],"$\\mathcal{N}\\mathcal{C":[84],"}$$O(m)$":[85],"processor":[86],"to":[88,113,160,168],"find":[89],"bipartite":[91],"matching":[92],"cardinality":[94],"(for":[100],"$\\epsilon^{-1}":[101],"=":[102],"O(\\operatorname{polylog}":[103],"(m))$).":[104],"use":[106],"novel":[108],"approach":[109,120],"based":[110],"path-counts":[112],"compute":[114],"blocking":[115],"flows":[116],"parallel.":[118],"This":[119],"produces":[121],"fractional":[122,152],"even":[124],"capacities":[126,159],"integral.":[128],"case":[131],"provide":[133],"rounding":[135,165],"that":[137],"independent":[140],"interest.":[141],"In":[142],"polylogarithmic":[143],"time":[144],"using":[145],"rounds":[150],"any":[151],"network":[156],"integral":[158,162],"The":[164],"technique":[166],"extends":[167],"costs.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}