{"id":"https://openalex.org/W2096769178","doi":"https://doi.org/10.1109/glocom.2010.5683842","title":"An Approximation Algorithm for Constructing Multicast Trees with Degree-Dependent Node Costs","display_name":"An Approximation Algorithm for Constructing Multicast Trees with Degree-Dependent Node Costs","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2096769178","doi":"https://doi.org/10.1109/glocom.2010.5683842","mag":"2096769178"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2010.5683842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683842","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-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/A5100688314","display_name":"Hwa-Chun Lin","orcid":"https://orcid.org/0000-0002-8811-8331"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hwa-Chun Lin","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan#TAB#","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043332867","display_name":"Hsiu-Ming Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hsiu-Ming Yang","raw_affiliation_strings":["Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","[Inst. of Commun. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"[Inst. of Commun. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan]","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3729,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66481561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":null,"first_page":"1","last_page":"5"},"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.9983999729156494,"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.9983999729156494,"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/T11478","display_name":"Caching and Content Delivery","score":0.9950000047683716,"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/T12288","display_name":"Optimization and Search Problems","score":0.9945999979972839,"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/multicast","display_name":"Multicast","score":0.9277532696723938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7338981032371521},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6805644035339355},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6657294034957886},{"id":"https://openalex.org/keywords/protocol-independent-multicast","display_name":"Protocol Independent Multicast","score":0.6531630158424377},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6453061103820801},{"id":"https://openalex.org/keywords/source-specific-multicast","display_name":"Source-specific multicast","score":0.6295010447502136},{"id":"https://openalex.org/keywords/xcast","display_name":"Xcast","score":0.6139246225357056},{"id":"https://openalex.org/keywords/pragmatic-general-multicast","display_name":"Pragmatic General Multicast","score":0.538693368434906},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5284953713417053},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5020649433135986},{"id":"https://openalex.org/keywords/distance-vector-multicast-routing-protocol","display_name":"Distance Vector Multicast Routing Protocol","score":0.46554267406463623},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45140185952186584},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4433589279651642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41864097118377686},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4176488220691681},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23131123185157776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19823133945465088},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11726579070091248},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.05272930860519409}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.9277532696723938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7338981032371521},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6805644035339355},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6657294034957886},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.6531630158424377},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6453061103820801},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.6295010447502136},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.6139246225357056},{"id":"https://openalex.org/C112037812","wikidata":"https://www.wikidata.org/wiki/Q2107523","display_name":"Pragmatic General Multicast","level":4,"score":0.538693368434906},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5284953713417053},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5020649433135986},{"id":"https://openalex.org/C42272142","wikidata":"https://www.wikidata.org/wiki/Q1229379","display_name":"Distance Vector Multicast Routing Protocol","level":4,"score":0.46554267406463623},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45140185952186584},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4433589279651642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41864097118377686},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4176488220691681},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23131123185157776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19823133945465088},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11726579070091248},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.05272930860519409},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2010.5683842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683842","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1005876121","https://openalex.org/W1963899113","https://openalex.org/W1975442866","https://openalex.org/W1977545325","https://openalex.org/W1998141189","https://openalex.org/W2042492403","https://openalex.org/W2047723482","https://openalex.org/W2162201886","https://openalex.org/W2172222998","https://openalex.org/W2177013801","https://openalex.org/W2401610261","https://openalex.org/W3148632216"],"related_works":["https://openalex.org/W80466176","https://openalex.org/W2371847117","https://openalex.org/W4321384965","https://openalex.org/W2080190883","https://openalex.org/W1559233856","https://openalex.org/W2044503969","https://openalex.org/W2136818972","https://openalex.org/W89592389","https://openalex.org/W2608999883","https://openalex.org/W1997462448"],"abstract_inverted_index":{"This":[0,92],"paper":[1,93],"studies":[2],"the":[3,27,30,33,47,75,79,83,87,101,107,115,120,123,128],"problem":[4],"of":[5,29,38,54,71,89,122],"constructing":[6],"a":[7,21,39,52,58,95],"minimum-cost":[8],"multicast":[9,34,48,76,124],"tree":[10,49,125],"(or":[11],"Seiner":[12],"tree)":[13],"in":[14],"which":[15],"each":[16,70],"node":[17,31,40,59,103],"is":[18,24,132],"associated":[19],"with":[20,100],"cost":[22,37,121],"that":[23],"dependent":[25],"on":[26,32,43,46,74,119],"degree":[28,45],"tree.":[35,77],"The":[36,117],"may":[41,60],"depend":[42],"its":[44,72],"due":[50],"to":[51,62,69,98,109],"number":[53,88],"reasons.":[55],"For":[56],"example,":[57],"need":[61],"perform":[63],"various":[64],"processing":[65,82],"for":[66,81,114],"sending":[67],"messages":[68,84],"neighbors":[73,90],"Thus,":[78],"overhead":[80],"increases":[85],"as":[86],"increases.":[91],"devises":[94],"novel":[96],"technique":[97,108],"deal":[99],"degree-dependent":[102],"costs":[104],"and":[105],"applies":[106],"develop":[110],"an":[111],"approximation":[112,130],"algorithm":[113,131],"problem.":[116],"bound":[118],"constructed":[126],"by":[127],"proposed":[129],"derived.":[133]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}