{"id":"https://openalex.org/W2112379399","doi":"https://doi.org/10.1109/i-span.2008.11","title":"On the Partial-Terminal Steiner Tree Problem","display_name":"On the Partial-Terminal Steiner Tree Problem","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2112379399","doi":"https://doi.org/10.1109/i-span.2008.11","mag":"2112379399"},"language":"en","primary_location":{"id":"doi:10.1109/i-span.2008.11","is_oa":false,"landing_page_url":"https://doi.org/10.1109/i-span.2008.11","pdf_url":null,"source":{"id":"https://openalex.org/S4210171064","display_name":"Proceedings of the ... International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN)","issn_l":"1087-4089","issn":["1087-4089","2375-527X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","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/A5103047340","display_name":"Sun\u2010Yuan Hsieh","orcid":"https://orcid.org/0000-0003-4746-3179"},"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":"Sun-Yuan Hsieh","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan","Department of Computer Science and Information Engineering National Cheng Kung University Tainan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering National Cheng Kung University Tainan","institution_ids":["https://openalex.org/I91807558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076914299","display_name":"Wen-Hao Pi","orcid":null},"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":false,"raw_author_name":"Wen-Hao Pi","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan","Department of Computer Science and Information Engineering National Cheng Kung University Tainan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering National Cheng Kung University Tainan","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103047340"],"corresponding_institution_ids":["https://openalex.org/I91807558"],"apc_list":null,"apc_paid":null,"fwci":0.6659,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73330281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9991999864578247,"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.996999979019165,"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.964968204498291},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8432588577270508},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.7320893406867981},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6193761825561523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.547200620174408},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5437009334564209},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4760189652442932},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4730378985404968},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.46274831891059875},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4586617350578308},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4582904577255249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31722235679626465},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2252611219882965},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11719578504562378}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.964968204498291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8432588577270508},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.7320893406867981},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6193761825561523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.547200620174408},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5437009334564209},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4760189652442932},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4730378985404968},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.46274831891059875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4586617350578308},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4582904577255249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31722235679626465},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2252611219882965},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11719578504562378},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/i-span.2008.11","is_oa":false,"landing_page_url":"https://doi.org/10.1109/i-span.2008.11","pdf_url":null,"source":{"id":"https://openalex.org/S4210171064","display_name":"Proceedings of the ... International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN)","issn_l":"1087-4089","issn":["1087-4089","2375-527X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1536000754","https://openalex.org/W1576246148","https://openalex.org/W1578824783","https://openalex.org/W1595291551","https://openalex.org/W1975442866","https://openalex.org/W1980288485","https://openalex.org/W1989076933","https://openalex.org/W1990327548","https://openalex.org/W1992573093","https://openalex.org/W2002762070","https://openalex.org/W2003882909","https://openalex.org/W2020112047","https://openalex.org/W2025002613","https://openalex.org/W2031493401","https://openalex.org/W2039298646","https://openalex.org/W2040579873","https://openalex.org/W2056824842","https://openalex.org/W2060380213","https://openalex.org/W2070664846","https://openalex.org/W2078008627","https://openalex.org/W2083213362","https://openalex.org/W2148352980","https://openalex.org/W2150253898","https://openalex.org/W2176547441","https://openalex.org/W2295961103","https://openalex.org/W2401610261","https://openalex.org/W2610052675","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W6647811010"],"related_works":["https://openalex.org/W2183636263","https://openalex.org/W1595291551","https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W2367195720","https://openalex.org/W2999680961","https://openalex.org/W1524393328","https://openalex.org/W1585318792","https://openalex.org/W2949165555","https://openalex.org/W2096702260"],"abstract_inverted_index":{"Given":[0],"a":[1,9,31,36,62],"complete":[2],"graph":[3],"G":[4],"=":[5],"(V,":[6],"E)":[7],"with":[8],"length":[10,69],"(or":[11],"cost)":[12],"function":[13],"c":[14],":":[15],"E":[16],"rarr":[17],"Qges":[18],"and":[19,25],"two":[20],"proper":[21],"subsets":[22],"R":[23,26,44],"subV":[24],"<sup":[27],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[28],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>":[29],"subeR,":[30],"partial-terminal":[32,55,63],"Steiner":[33,37,56,64,90],"tree":[34,38,57,65,91],"is":[35,59,80,84,109],"which":[39],"contains":[40],"all":[41,47],"vertices":[42,48],"in":[43,49,70],"such":[45],"that":[46],"R'":[50],"must":[51],"be":[52],"leaves.":[53],"The":[54,72],"problem":[58,79],"to":[60,102],"find":[61],"of":[66,77,88],"the":[67,78,85,89,98],"minimum":[68],"G.":[71],"previously":[73],"best-known":[74],"approximation":[75,86],"ratio":[76,87,99],"2rho,":[81],"where":[82,107],"p":[83],"problem.":[92],"In":[93],"this":[94],"paper,":[95],"we":[96],"improve":[97],"from":[100],"2rho":[101,103],"-":[104],"(rho/(3rho-2))-":[105],"epsi,":[106],"epsi":[108],"some":[110],"non-negative":[111],"number.":[112]},"counts_by_year":[{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}