{"id":"https://openalex.org/W2127985326","doi":"https://doi.org/10.1007/s10107-014-0856-z","title":"The all-or-nothing flow problem in directed graphs with symmetric demand pairs","display_name":"The all-or-nothing flow problem in directed graphs with symmetric demand pairs","publication_year":2014,"publication_date":"2014-12-19","ids":{"openalex":"https://openalex.org/W2127985326","doi":"https://doi.org/10.1007/s10107-014-0856-z","mag":"2127985326"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-014-0856-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-014-0856-z","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Chicago, IL, USA","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025907388","display_name":"Alina Ene","orcid":"https://orcid.org/0000-0002-5818-1807"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]},{"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":["GB","US"],"is_corresponding":true,"raw_author_name":"Alina Ene","raw_affiliation_strings":["Center for Computational Intractability, Princeton University, Princeton, NJ, USA","Department of Computer Science and DIMAP, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Center for Computational Intractability, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Computer Science and DIMAP, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025907388"],"corresponding_institution_ids":["https://openalex.org/I20089843","https://openalex.org/I39555362"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.15315345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"154","issue":"1-2","first_page":"249","last_page":"272"},"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.9998000264167786,"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.9998000264167786,"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.9995999932289124,"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.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7797373533248901},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7067119479179382},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6623049974441528},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6293128728866577},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5535938739776611},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4874715805053711},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4523783326148987},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4446220099925995},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4419700503349304},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43889039754867554},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4123110771179199},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.40170547366142273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11695453524589539}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7797373533248901},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7067119479179382},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6623049974441528},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6293128728866577},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5535938739776611},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4874715805053711},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4523783326148987},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4446220099925995},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4419700503349304},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43889039754867554},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4123110771179199},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.40170547366142273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11695453524589539},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-014-0856-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-014-0856-z","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:wrap.warwick.ac.uk:64397","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Book Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W133962531","https://openalex.org/W748479430","https://openalex.org/W1974018476","https://openalex.org/W1976463682","https://openalex.org/W1979444789","https://openalex.org/W1986291656","https://openalex.org/W1999867351","https://openalex.org/W2003160050","https://openalex.org/W2007627758","https://openalex.org/W2019062750","https://openalex.org/W2033480692","https://openalex.org/W2042899161","https://openalex.org/W2054167510","https://openalex.org/W2057826895","https://openalex.org/W2069159763","https://openalex.org/W2076164610","https://openalex.org/W2079873939","https://openalex.org/W2081304472","https://openalex.org/W2085348754","https://openalex.org/W2090787331","https://openalex.org/W2091004914","https://openalex.org/W2122997342","https://openalex.org/W2126492985","https://openalex.org/W2127114399","https://openalex.org/W2127618440","https://openalex.org/W2135424293","https://openalex.org/W2140262267","https://openalex.org/W2146728909","https://openalex.org/W2150148016","https://openalex.org/W2152982698","https://openalex.org/W2154571828","https://openalex.org/W2170344325","https://openalex.org/W2176446742","https://openalex.org/W2212790795","https://openalex.org/W2265520488","https://openalex.org/W2401610261","https://openalex.org/W2569646339","https://openalex.org/W2584961879","https://openalex.org/W2949739362","https://openalex.org/W3149604617","https://openalex.org/W4232231123","https://openalex.org/W4245052308"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W3161514703","https://openalex.org/W2531764854","https://openalex.org/W1994440468","https://openalex.org/W2368069542","https://openalex.org/W4311255633","https://openalex.org/W1970952976"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}