{"id":"https://openalex.org/W2171565779","doi":"https://doi.org/10.1007/s10107-010-0366-6","title":"Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation","display_name":"Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation","publication_year":2010,"publication_date":"2010-05-10","ids":{"openalex":"https://openalex.org/W2171565779","doi":"https://doi.org/10.1007/s10107-010-0366-6","mag":"2171565779"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-010-0366-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0366-6","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5101855070","display_name":"A. Ridha Mahjoub","orcid":"https://orcid.org/0000-0002-1079-1892"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"A. Ridha Mahjoub","raw_affiliation_strings":["Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS Place du Mar\u00e9chal de Lattre de Tassigny, 75775, Paris Cedex 16, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS Place du Mar\u00e9chal de Lattre de Tassigny, 75775, Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079981879","display_name":"S. Thomas McCormick","orcid":"https://orcid.org/0000-0002-2828-4100"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. Thomas McCormick","raw_affiliation_strings":["Sauder School of Business, University of British Columbia, Vancouver, BC, V6T 1Z2, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sauder School of Business, University of British Columbia, Vancouver, BC, V6T 1Z2, Canada","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101855070"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0302,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.78923618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"124","issue":"1-2","first_page":"271","last_page":"284"},"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.9983999729156494,"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.9983999729156494,"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.9947999715805054,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8197270631790161},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7092980146408081},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6763373017311096},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5637481212615967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47238802909851074},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45697104930877686},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.42699626088142395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38238489627838135},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16451120376586914},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08132973313331604}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8197270631790161},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7092980146408081},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6763373017311096},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5637481212615967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47238802909851074},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45697104930877686},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.42699626088142395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38238489627838135},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16451120376586914},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08132973313331604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-010-0366-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0366-6","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/5296","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5296","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"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 accept\u00e9 pour publication ou publi\u00e9"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W7302391","https://openalex.org/W369902189","https://openalex.org/W391976303","https://openalex.org/W1568987606","https://openalex.org/W1595120036","https://openalex.org/W1981333947","https://openalex.org/W1984783231","https://openalex.org/W1997272880","https://openalex.org/W1999679195","https://openalex.org/W2000733920","https://openalex.org/W2002531683","https://openalex.org/W2006877095","https://openalex.org/W2008133042","https://openalex.org/W2011039300","https://openalex.org/W2016801268","https://openalex.org/W2032711721","https://openalex.org/W2034269606","https://openalex.org/W2036652785","https://openalex.org/W2039803631","https://openalex.org/W2049236593","https://openalex.org/W2059690430","https://openalex.org/W2065297120","https://openalex.org/W2072947773","https://openalex.org/W2079911323","https://openalex.org/W2089135840","https://openalex.org/W2100440346","https://openalex.org/W2142299762","https://openalex.org/W2149677317","https://openalex.org/W2150626176","https://openalex.org/W4213060883","https://openalex.org/W4231512181","https://openalex.org/W4241397890","https://openalex.org/W4254899134","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2037387767","https://openalex.org/W2745252358","https://openalex.org/W3165634411","https://openalex.org/W4297063357","https://openalex.org/W3000809962","https://openalex.org/W2501971168","https://openalex.org/W2113647243","https://openalex.org/W1512148653","https://openalex.org/W2778127909","https://openalex.org/W3127344537"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-06T09:05:17.133730","created_date":"2025-10-10T00:00:00"}