{"id":"https://openalex.org/W2790051147","doi":"https://doi.org/10.12783/dtcse/wcne2017/19876","title":"An Improved Min-cost Max-flow Network Coding Algorithm","display_name":"An Improved Min-cost Max-flow Network Coding Algorithm","publication_year":2018,"publication_date":"2018-03-09","ids":{"openalex":"https://openalex.org/W2790051147","doi":"https://doi.org/10.12783/dtcse/wcne2017/19876","mag":"2790051147"},"language":"en","primary_location":{"id":"doi:10.12783/dtcse/wcne2017/19876","doi":"https://doi.org/10.12783/dtcse/wcne2017/19876","is_oa":true,"landing_page_url":"https://doi.org/10.12783/dtcse/wcne2017/19876","pdf_url":null,"source":{"id":"https://openalex.org/S2764550102","display_name":"DEStech Transactions on Computer Science and Engineering","issn_l":"2475-8841","issn":["2475-8841"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322697008","host_organization_name":"Destech Publications","host_organization_lineage":["https://openalex.org/P4322697008"],"host_organization_lineage_names":["Destech Publications"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DEStech Transactions on Computer Science and Engineering","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.12783/dtcse/wcne2017/19876","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069949336","display_name":"Yang-tian-xiu HU","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang-tian-xiu HU","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108501920","display_name":"Limin Meng","orcid":"https://orcid.org/0009-0006-2497-1727","observed_orcids":["https://orcid.org/0009-0006-2497-1727"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li-min MENG","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012965548","display_name":"Pei-rui JIANG","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pei-rui JIANG","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083725621","display_name":"Yuzhou Shang","orcid":"https://orcid.org/0000-0001-8088-1538","observed_orcids":["https://orcid.org/0000-0001-8088-1538"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu-zhou SHANG","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":"wcne","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9487000107765198,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9487000107765198,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.01590000092983246,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.014499999582767487,"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/network-coding","display_name":"network coding","score":0.9990000128746033},{"id":"https://openalex.org/keywords/min-cost-max-flow","display_name":"min-cost max-flow","score":0.9599999785423279},{"id":"https://openalex.org/keywords/resource-consumption-reduction","display_name":"resource consumption reduction","score":0.7860000133514404},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.5450000166893005},{"id":"https://openalex.org/keywords/flow-augmentation","display_name":"flow enhancement","score":0.5370000004768372}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8227815628051758},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.782434344291687},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6807080507278442},{"id":"https://openalex.org/C2777480716","wikidata":"https://www.wikidata.org/wiki/Q23582796","display_name":"Resource consumption","level":2,"score":0.6671262979507446},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5661975145339966},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5580158233642578},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5263612866401672},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4834640622138977},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47646427154541016},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44790881872177124},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.41513293981552124},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3854679763317108},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2802286446094513},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16431650519371033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14582377672195435},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06199875473976135},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.12783/dtcse/wcne2017/19876","doi":"https://doi.org/10.12783/dtcse/wcne2017/19876","is_oa":true,"landing_page_url":"https://doi.org/10.12783/dtcse/wcne2017/19876","pdf_url":null,"source":{"id":"https://openalex.org/S2764550102","display_name":"DEStech Transactions on Computer Science and Engineering","issn_l":"2475-8841","issn":["2475-8841"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322697008","host_organization_name":"Destech Publications","host_organization_lineage":["https://openalex.org/P4322697008"],"host_organization_lineage_names":["Destech Publications"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DEStech Transactions on Computer Science and Engineering","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.12783/dtcse/wcne2017/19876","doi":"https://doi.org/10.12783/dtcse/wcne2017/19876","is_oa":true,"landing_page_url":"https://doi.org/10.12783/dtcse/wcne2017/19876","pdf_url":null,"source":{"id":"https://openalex.org/S2764550102","display_name":"DEStech Transactions on Computer Science and Engineering","issn_l":"2475-8841","issn":["2475-8841"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322697008","host_organization_name":"Destech Publications","host_organization_lineage":["https://openalex.org/P4322697008"],"host_organization_lineage_names":["Destech Publications"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DEStech Transactions on Computer Science and Engineering","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4943999946117401}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2896266139","https://openalex.org/W2155516205","https://openalex.org/W2323343203","https://openalex.org/W2151896466","https://openalex.org/W2150645033","https://openalex.org/W2794691895","https://openalex.org/W3161943729","https://openalex.org/W1691818332","https://openalex.org/W2542483072","https://openalex.org/W2370817353"],"abstract_inverted_index":{"Network":[0],"coding":[1,31],"can":[2,84],"significantly":[3],"improve":[4],"the":[5,10,38,50,56,60,64,68,77,88,94,98,105],"network":[6,30,51,99,106],"communication":[7],"performance;":[8],"however,":[9],"introduction":[11],"of":[12,41],"encoding":[13,42,95],"nodes":[14,96],"will":[15],"lead":[16],"to":[17,33,55,67,104],"more":[18],"resource":[19,35,100],"consumption.":[20],"In":[21],"this":[22,81],"paper,":[23],"we":[24],"proposed":[25],"an":[26],"improved":[27,82],"Min-cost":[28],"Max-flow":[29],"algorithm":[32,83],"reduce":[34,87,93],"consumption":[36],"under":[37],"new":[39],"principle":[40],"node,":[43],"which":[44],"has":[45],"been":[46],"augmented":[47],"until":[48],"achieves":[49],"maximum":[52],"flow":[53],"according":[54],"min-cost":[57],"path":[58],"in":[59],"shortest":[61],"paths":[62],"from":[63],"source":[65],"node":[66],"sink":[69],"node.":[70],"Simulation":[71],"results":[72],"show":[73],"that":[74],"compared":[75],"with":[76],"previous":[78],"max-flow":[79],"algorithm,":[80],"not":[85],"only":[86],"total":[89],"cost,":[90],"but":[91],"also":[92],"and":[97],"overhead":[101],"when":[102],"applied":[103],"coding.":[107]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2018-03-29T00:00:00"}