{"id":"https://openalex.org/W2964094145","doi":"https://doi.org/10.1145/3322645.3322649","title":"An Efficient Approximation Algorithm for the Steiner Tree Problem","display_name":"An Efficient Approximation Algorithm for the Steiner Tree Problem","publication_year":2019,"publication_date":"2019-03-16","ids":{"openalex":"https://openalex.org/W2964094145","doi":"https://doi.org/10.1145/3322645.3322649","mag":"2964094145"},"language":"en","primary_location":{"id":"doi:10.1145/3322645.3322649","doi":"https://doi.org/10.1145/3322645.3322649","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3322645.3322649","pdf_url":null,"source":{"id":"https://openalex.org/S7407086741","display_name":"International Conference on Information Science and Systems (ICISS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 2nd International Conference on Information Science and Systems","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5027480824","display_name":"Chi\u2010Yeh Chen","orcid":"https://orcid.org/0000-0001-9664-8538","observed_orcids":["https://orcid.org/0000-0001-9664-8538"]},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chi-Yeh Chen","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027480824"],"corresponding_institution_ids":["https://openalex.org/I91807558"],"apc_list":null,"apc_paid":null,"fwci":1.05,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.72010536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"24","issue":null,"first_page":"179","last_page":"184"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.0,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9990000128746033},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9070000052452087},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.5630000233650208},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.578000009059906},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.628000020980835},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.6179999709129333},{"id":"https://openalex.org/keywords/weighted-graphs","display_name":"weighted graphs","score":0.5329999923706055}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8833482265472412},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7062503695487976},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5781772136688232},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5297326445579529},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.52617347240448},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5210568308830261},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5151523351669312},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5144839286804199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5117082595825195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.50545334815979},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43985074758529663},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4318251609802246},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3999173939228058},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38394850492477417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37262627482414246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34500786662101746},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2825569808483124},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.22614410519599915},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.14681702852249146},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10082590579986572},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3322645.3322649","doi":"https://doi.org/10.1145/3322645.3322649","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3322645.3322649","pdf_url":null,"source":{"id":"https://openalex.org/S7407086741","display_name":"International Conference on Information Science and Systems (ICISS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 2nd International Conference on Information Science and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W205399339","https://openalex.org/W1485792125","https://openalex.org/W1511480398","https://openalex.org/W1535706250","https://openalex.org/W1568391568","https://openalex.org/W1578824783","https://openalex.org/W1595291551","https://openalex.org/W1967576404","https://openalex.org/W1976584101","https://openalex.org/W1980288485","https://openalex.org/W1989076933","https://openalex.org/W1992573093","https://openalex.org/W2003882909","https://openalex.org/W2011823863","https://openalex.org/W2012130001","https://openalex.org/W2023370539","https://openalex.org/W2024884029","https://openalex.org/W2025002613","https://openalex.org/W2027515293","https://openalex.org/W2039298646","https://openalex.org/W2042492403","https://openalex.org/W2049184889","https://openalex.org/W2056824842","https://openalex.org/W2070664846","https://openalex.org/W2078008627","https://openalex.org/W2084415648","https://openalex.org/W2089847997","https://openalex.org/W2122195804","https://openalex.org/W2123087902","https://openalex.org/W2135965211","https://openalex.org/W2150253898","https://openalex.org/W2152619617","https://openalex.org/W2165142526","https://openalex.org/W2176547441","https://openalex.org/W2276707316","https://openalex.org/W2295961103","https://openalex.org/W2570206580","https://openalex.org/W3127447045","https://openalex.org/W4246633849"],"related_works":["https://openalex.org/W2754301405","https://openalex.org/W1550399701","https://openalex.org/W1991055327","https://openalex.org/W2513418505","https://openalex.org/W2014153423","https://openalex.org/W1990327548","https://openalex.org/W1519758470","https://openalex.org/W4395072524","https://openalex.org/W2121370879","https://openalex.org/W2039298646"],"abstract_inverted_index":{"The":[0],"Steiner":[1],"tree":[2,22],"problem":[3],"is":[4,43,58,79],"one":[5],"of":[6,27,97],"the":[7,28,40,62],"classic":[8],"and":[9],"most":[10],"fundamental":[11],"NP-hard":[12],"problems:":[13],"given":[14,25],"an":[15,85,94],"arbitrary":[16],"weighted":[17],"graph,":[18],"seek":[19],"a":[20,24,35,50],"minimum-cost":[21],"spanning":[23],"subset":[26],"vertices":[29],"(terminals).":[30],"Byrka":[31],"et":[32,53],"al.":[33,54],"proposed":[34],"1.3863+\u03f5-approximation":[36],"algorithm":[37],"in":[38,89],"which":[39],"linear":[41],"program":[42],"solved":[44],"at":[45],"every":[46],"iteration":[47],"after":[48],"contracting":[49],"component.":[51],"Goemans":[52],"shown":[55],"that":[56,92],"it":[57],"possible":[59],"to":[60],"achieve":[61],"same":[63],"approximation":[64,95],"guarantee":[65],"while":[66],"only":[67],"solving":[68],"hypergraphic":[69,75],"LP":[70,76],"relaxation":[71,77],"once.":[72],"However,":[73],"optimizing":[74],"exactly":[78],"strongly":[80],"NP-hard.":[81],"This":[82],"article":[83],"presents":[84],"efficient":[86],"two-phase":[87],"heuristic":[88],"greedy":[90],"strategy":[91],"achieves":[93],"ratio":[96],"1.4295.":[98]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-07-30T00:00:00"}