{"id":"https://openalex.org/W1992520677","doi":"https://doi.org/10.1007/bf01200755","title":"An approximate max-flow min-cut relation for undirected multicommodity flow, with applications","display_name":"An approximate max-flow min-cut relation for undirected multicommodity flow, with applications","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W1992520677","doi":"https://doi.org/10.1007/bf01200755","mag":"1992520677"},"language":"en","primary_location":{"id":"doi:10.1007/bf01200755","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01200755","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","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/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Philip Klein","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912, Providence, RI, USA","Dept of Computer Science, Brown University, Providence, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Dept of Computer Science, Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103783564","display_name":"Satish Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":["NEC Research Institute, 4 Independence Way, 08540, Princeton, NJ, USA","Nec Research Institute, Princeton, USA"],"affiliations":[{"raw_affiliation_string":"NEC Research Institute, 4 Independence Way, 08540, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Nec Research Institute, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110436285","display_name":"Ajit Agrawal","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088930","display_name":"GVD Corporation (United States)","ror":"https://ror.org/009y6jy27","country_code":"US","type":"company","lineage":["https://openalex.org/I4210088930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ajit Agrawal","raw_affiliation_strings":["Exa Corporation, 125 Cambridge Park Drive, 02140, Cambridge, MA","Exa Corporation, Cambridge,"],"affiliations":[{"raw_affiliation_string":"Exa Corporation, 125 Cambridge Park Drive, 02140, Cambridge, MA","institution_ids":["https://openalex.org/I4210088930"]},{"raw_affiliation_string":"Exa Corporation, Cambridge,","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]},{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["DIMACS Center, Rutgers University, P. O. Box 1170, 08855-1179, Piscataway, NJ, USA","DIMACS Center, Rutgers University, Piscataway, USA"],"affiliations":[{"raw_affiliation_string":"DIMACS Center, Rutgers University, P. O. Box 1170, 08855-1179, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I2799411422"]},{"raw_affiliation_string":"DIMACS Center, Rutgers University, Piscataway, USA","institution_ids":["https://openalex.org/I2799411422","https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5035567880"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":4.8315,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.95195108,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"2","first_page":"187","last_page":"202"},"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.9977999925613403,"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.9977999925613403,"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.9976000189781189,"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.9968000054359436,"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.84113609790802},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7820805311203003},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6538093090057373},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6495610475540161},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6251672506332397},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5744973421096802},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5414815545082092},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.49539506435394287},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.473501980304718},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.451797217130661},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4473450183868408},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.44434884190559387},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.41496506333351135},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32437124848365784},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07588014006614685},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0723876953125}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.84113609790802},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7820805311203003},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6538093090057373},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6495610475540161},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6251672506332397},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5744973421096802},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5414815545082092},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.49539506435394287},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.473501980304718},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.451797217130661},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4473450183868408},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.44434884190559387},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.41496506333351135},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32437124848365784},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07588014006614685},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0723876953125},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01200755","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01200755","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","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":33,"referenced_works":["https://openalex.org/W192261506","https://openalex.org/W1489650731","https://openalex.org/W1516470529","https://openalex.org/W1519644264","https://openalex.org/W1524804355","https://openalex.org/W1563351955","https://openalex.org/W1964119857","https://openalex.org/W1975099798","https://openalex.org/W1980967952","https://openalex.org/W1993946385","https://openalex.org/W2001942464","https://openalex.org/W2010223239","https://openalex.org/W2011039300","https://openalex.org/W2012357906","https://openalex.org/W2016719826","https://openalex.org/W2018279087","https://openalex.org/W2035652501","https://openalex.org/W2040579873","https://openalex.org/W2040924621","https://openalex.org/W2059401572","https://openalex.org/W2065014601","https://openalex.org/W2069702698","https://openalex.org/W2117319425","https://openalex.org/W2121902703","https://openalex.org/W2125278290","https://openalex.org/W2141923701","https://openalex.org/W2150815458","https://openalex.org/W2152195131","https://openalex.org/W2154501376","https://openalex.org/W2159739530","https://openalex.org/W2610755752","https://openalex.org/W3145896515","https://openalex.org/W3152126650"],"related_works":["https://openalex.org/W2186707160","https://openalex.org/W2141353198","https://openalex.org/W1974018476","https://openalex.org/W2115772827","https://openalex.org/W1976196087","https://openalex.org/W2130132511","https://openalex.org/W2068595367","https://openalex.org/W115807216","https://openalex.org/W4235911878","https://openalex.org/W3210180238"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}