{"id":"https://openalex.org/W2012086853","doi":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-u","title":"Balanced network flows. II. Simple augmentation algorithms","display_name":"Balanced network flows. II. Simple augmentation algorithms","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2012086853","doi":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-u","mag":"2012086853"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-u","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-u","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5033203261","display_name":"Christian Fremuth-Paeger","orcid":null},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Fremuth-Paeger","raw_affiliation_strings":["Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021380531","display_name":"Dieter Jungnickel","orcid":"https://orcid.org/0000-0001-5615-6934"},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dieter Jungnickel","raw_affiliation_strings":["Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021380531"],"corresponding_institution_ids":["https://openalex.org/I179225836"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.2098,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83572734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"33","issue":"1","first_page":"29","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9882000088691711,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9882000088691711,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9797999858856201,"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/simple","display_name":"Simple (philosophy)","score":0.6339603662490845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6174188852310181},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6002597808837891},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5930296182632446},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.586086094379425},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5571969151496887},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5492260456085205},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4867834746837616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4389096796512604},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.41830167174339294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32199111580848694}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6339603662490845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6174188852310181},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6002597808837891},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5930296182632446},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.586086094379425},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5571969151496887},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5492260456085205},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4867834746837616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4389096796512604},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.41830167174339294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32199111580848694},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-u","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-u","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.310.3497","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.3497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~pettie/matching/Fremuth-Paeger-Jungnickel-balanced-network-flow-II-simple-augmentation-algs.pdf","raw_type":"text"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:28299","is_oa":false,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/28299","pdf_url":null,"source":{"id":"https://openalex.org/S4377196968","display_name":"Publication Server OPUS (University of Augsburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I179225836","host_organization_name":"University of Augsburg","host_organization_lineage":["https://openalex.org/I179225836"],"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W72083884","https://openalex.org/W1499313444","https://openalex.org/W1513400187","https://openalex.org/W1964119857","https://openalex.org/W1986022261","https://openalex.org/W1986600094","https://openalex.org/W2003813631","https://openalex.org/W2028503265","https://openalex.org/W2752885492","https://openalex.org/W4210727445","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367","https://openalex.org/W3035974271"],"abstract_inverted_index":{"In":[0,20],"previous":[1],"papers,":[2],"we":[3,23],"discussed":[4],"the":[5,31,47],"fundamental":[6],"theory":[7],"of":[8,15,34],"matching":[9,36],"problems":[10,37,45],"and":[11,38,46],"algorithms":[12],"in":[13],"terms":[14],"a":[16],"network":[17],"flow":[18],"model.":[19],"this":[21],"paper,":[22],"present":[24],"explicit":[25],"augmentation":[26],"procedures":[27],"which":[28,39],"apply":[29],"to":[30],"wide":[32],"range":[33],"capacitated":[35],"are":[40],"highly":[41],"efficient":[42],"for":[43],"k-factor":[44],"f-factor":[48],"problem.":[49],"\u00a9":[50],"1999":[51,60],"John":[52],"Wiley":[53],"&":[54],"Sons,":[55],"Inc.":[56],"Networks":[57],"33:":[58],"29\u201341,":[59]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}