{"id":"https://openalex.org/W1489067511","doi":"https://doi.org/10.1007/978-3-540-24767-8_37","title":"Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems","display_name":"Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1489067511","doi":"https://doi.org/10.1007/978-3-540-24767-8_37","mag":"1489067511"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-24767-8_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24767-8_37","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5101620949","display_name":"Yen Hung Chen","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":true,"raw_author_name":"Yen Hung Chen","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan, R.O.C","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102785037","display_name":"Bang Wu","orcid":"https://orcid.org/0000-0002-8097-7852"},"institutions":[{"id":"https://openalex.org/I4210134750","display_name":"Shu-Te University","ror":"https://ror.org/03pcb1m79","country_code":"TW","type":"education","lineage":["https://openalex.org/I4210134750"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Bang Ye Wu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Shu-Te University, YenChau Kaoshiung 824, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Shu-Te University, YenChau Kaoshiung 824, Taiwan, R.O.C","institution_ids":["https://openalex.org/I4210134750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101474162","display_name":"Chuan Yi Tang","orcid":"https://orcid.org/0000-0003-0729-1624"},"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":"Chuan Yi Tang","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan, R.O.C","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101620949"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2767,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56651109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"355","last_page":"366"},"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.9993000030517578,"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.9993000030517578,"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.9925000071525574,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9901000261306763,"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/spanning-tree","display_name":"Spanning tree","score":0.7783778309822083},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.7219724059104919},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.7115790843963623},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6266118288040161},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6226020455360413},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6214040517807007},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5958855152130127},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5805041790008545},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5758134722709656},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.4906369745731354},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.45772939920425415},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.425179123878479},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42442482709884644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41602444648742676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4040471911430359},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32432422041893005},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.27988654375076294},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1858910620212555},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.18154671788215637}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7783778309822083},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.7219724059104919},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.7115790843963623},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6266118288040161},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6226020455360413},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6214040517807007},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5958855152130127},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5805041790008545},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5758134722709656},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.4906369745731354},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.45772939920425415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.425179123878479},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42442482709884644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41602444648742676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4040471911430359},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32432422041893005},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.27988654375076294},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1858910620212555},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.18154671788215637},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-24767-8_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24767-8_37","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1977545325","https://openalex.org/W1983995412","https://openalex.org/W1999545213","https://openalex.org/W2003847232","https://openalex.org/W2008014328","https://openalex.org/W2011039300","https://openalex.org/W2016218947","https://openalex.org/W2030879379","https://openalex.org/W2088257048","https://openalex.org/W3138832177","https://openalex.org/W3145128584","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W1587959445","https://openalex.org/W3016811403","https://openalex.org/W1898478360","https://openalex.org/W3081212354","https://openalex.org/W4239736023","https://openalex.org/W1991421283","https://openalex.org/W620960161"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}