{"id":"https://openalex.org/W2030879379","doi":"https://doi.org/10.1016/s0166-218x(99)00212-7","title":"Approximation algorithms for some optimum communication spanning tree problems","display_name":"Approximation algorithms for some optimum communication spanning tree problems","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W2030879379","doi":"https://doi.org/10.1016/s0166-218x(99)00212-7","mag":"2030879379"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(99)00212-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(99)00212-7","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5012701826","display_name":"Bang Ye Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I189290911","display_name":"National Chung Shan Institute of Science and Technology","ror":"https://ror.org/034ezwg26","country_code":"TW","type":"government","lineage":["https://openalex.org/I189290911"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Bang Ye Wu","raw_affiliation_strings":["Chung-Shan Institute of Science and Technology, P.O. Box No. 90008-6-8, Lung-Tan, Taiwan"],"affiliations":[{"raw_affiliation_string":"Chung-Shan Institute of Science and Technology, P.O. Box No. 90008-6-8, Lung-Tan, Taiwan","institution_ids":["https://openalex.org/I189290911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033888490","display_name":"Kun\u2010Mao Chao","orcid":"https://orcid.org/0000-0003-2837-1279"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]},{"id":"https://openalex.org/I4210087697","display_name":"National Yang Ming University Hospital","ror":"https://ror.org/003xdw211","country_code":"TW","type":"healthcare","lineage":["https://openalex.org/I4210087697"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Kun-Mao Chao","raw_affiliation_strings":["Department of Life Science, National Yang-Ming University, Taipei, Taiwan","Dept. of Life Sci., Nat. Yang Ming Univ., Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Life Science, National Yang-Ming University, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210087697","https://openalex.org/I148366613"]},{"raw_affiliation_string":"Dept. of Life Sci., Nat. Yang Ming Univ., Taipei, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"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, Taiwan","Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan#TAB#"],"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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033888490"],"corresponding_institution_ids":["https://openalex.org/I148366613","https://openalex.org/I4210087697"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":3.7532,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.93114533,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"102","issue":"3","first_page":"245","last_page":"266"},"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.9994999766349792,"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.9994999766349792,"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.9983999729156494,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8740214705467224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7514451742172241},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.7364600300788879},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.7254796028137207},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7223101258277893},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.694475531578064},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6698051691055298},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.54857337474823},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5292619466781616},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4818459749221802},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.47180238366127014},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4652235209941864},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4622578024864197},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.45891886949539185},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4287649393081665},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42403626441955566},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4216490387916565},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4119933545589447},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.40405452251434326},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2764493525028229},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.12844371795654297}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8740214705467224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7514451742172241},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.7364600300788879},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.7254796028137207},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7223101258277893},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.694475531578064},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6698051691055298},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.54857337474823},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5292619466781616},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4818459749221802},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.47180238366127014},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4652235209941864},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4622578024864197},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.45891886949539185},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4287649393081665},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42403626441955566},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4216490387916565},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4119933545589447},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.40405452251434326},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2764493525028229},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.12844371795654297}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(99)00212-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(99)00212-7","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1973297532","https://openalex.org/W2016218947","https://openalex.org/W2047517090","https://openalex.org/W2752885492","https://openalex.org/W3138832177","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1997570556","https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W1576317141","https://openalex.org/W1978034843","https://openalex.org/W3081212354","https://openalex.org/W1958279402","https://openalex.org/W2030879379","https://openalex.org/W2582147058","https://openalex.org/W2281826919"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}