{"id":"https://openalex.org/W2614327298","doi":"https://doi.org/10.1007/s00224-017-9776-7","title":"Minimum-Cost Flows in Unit-Capacity Networks","display_name":"Minimum-Cost Flows in Unit-Capacity Networks","publication_year":2017,"publication_date":"2017-05-15","ids":{"openalex":"https://openalex.org/W2614327298","doi":"https://doi.org/10.1007/s00224-017-9776-7","mag":"2614327298"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-017-9776-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-017-9776-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","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/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Amazon.com Inc, E. Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Amazon.com Inc, E. Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1311688040"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015780024","display_name":"Sagi Hed","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Sagi Hed","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"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"]},{"id":"https://openalex.org/I1320758411","display_name":"Entrust","ror":"https://ror.org/01deqjx32","country_code":"GB","type":"other","lineage":["https://openalex.org/I1320758411"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, 08540, USA","Intertrust Technologies, Sunnyvale, CA, 94085, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, 08540, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Intertrust Technologies, Sunnyvale, CA, 94085, USA","institution_ids":["https://openalex.org/I1320758411"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111783338"],"corresponding_institution_ids":["https://openalex.org/I1311688040"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.6595,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8535986,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"61","issue":"4","first_page":"987","last_page":"1010"},"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.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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.9988999962806702,"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/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7600542306900024},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6807853579521179},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.577028751373291},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5090431571006775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49012765288352966},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46796947717666626},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4598008990287781},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43651577830314636},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43457168340682983},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.42982712388038635},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.42610493302345276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4084187150001526},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3874807357788086},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38342034816741943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3495292663574219},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08844459056854248}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7600542306900024},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6807853579521179},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.577028751373291},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5090431571006775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49012765288352966},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46796947717666626},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4598008990287781},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43651577830314636},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43457168340682983},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.42982712388038635},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.42610493302345276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4084187150001526},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3874807357788086},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38342034816741943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3495292663574219},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08844459056854248},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-017-9776-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-017-9776-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.6000000238418579,"id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G2871243471","display_name":null,"funder_award_id":"1841/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G6336833333","display_name":null,"funder_award_id":"822-10","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G8719561236","display_name":null,"funder_award_id":"1161/2011","funder_id":"https://openalex.org/F4320320947","funder_display_name":"German-Israeli Foundation for Scientific Research and Development"}],"funders":[{"id":"https://openalex.org/F4320320947","display_name":"German-Israeli Foundation for Scientific Research and Development","ror":"https://ror.org/00tntzp09"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1675653635","https://openalex.org/W1964160573","https://openalex.org/W1969357318","https://openalex.org/W1973907457","https://openalex.org/W1977545325","https://openalex.org/W1978757752","https://openalex.org/W2008292658","https://openalex.org/W2037823059","https://openalex.org/W2055536684","https://openalex.org/W2061872629","https://openalex.org/W2073647817","https://openalex.org/W2075322358","https://openalex.org/W2084224084","https://openalex.org/W2125690626","https://openalex.org/W2133352257","https://openalex.org/W2139559590","https://openalex.org/W2150154671","https://openalex.org/W2156036190","https://openalex.org/W2157529519","https://openalex.org/W2164141517","https://openalex.org/W2338905098","https://openalex.org/W2345496427","https://openalex.org/W2568484534","https://openalex.org/W2692373750","https://openalex.org/W2803802148","https://openalex.org/W4247927012","https://openalex.org/W4249075686"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3161514703","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W1994440468","https://openalex.org/W2051329268","https://openalex.org/W2531764854","https://openalex.org/W2182648737"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}