{"id":"https://openalex.org/W2402805681","doi":"https://doi.org/10.1007/978-3-319-03780-6_6","title":"On the Clustered Steiner Tree Problem","display_name":"On the Clustered Steiner Tree Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2402805681","doi":"https://doi.org/10.1007/978-3-319-03780-6_6","mag":"2402805681"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-03780-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03780-6_6","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/A5102785037","display_name":"Bang Wu","orcid":"https://orcid.org/0000-0002-8097-7852"},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Bang Ye Wu","raw_affiliation_strings":["National Chung Cheng University, ChiaYi, 621, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"National Chung Cheng University, ChiaYi, 621, Taiwan, R.O.C","institution_ids":["https://openalex.org/I148099254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102785037"],"corresponding_institution_ids":["https://openalex.org/I148099254"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.091,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.82242152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"60","last_page":"71"},"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.9997000098228455,"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.9997000098228455,"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.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.9976000189781189,"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.9732049107551575},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6801234483718872},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.637473464012146},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6331321001052856},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6246300935745239},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5517305731773376},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5499550104141235},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5481361746788025},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5192815661430359},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5188995003700256},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.49533405900001526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4761747717857361},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4519370496273041},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44779160618782043},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.43542999029159546},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4045458137989044},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2893250584602356},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.139570951461792}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9732049107551575},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6801234483718872},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.637473464012146},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6331321001052856},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6246300935745239},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5517305731773376},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5499550104141235},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5481361746788025},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5192815661430359},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5188995003700256},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.49533405900001526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4761747717857361},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4519370496273041},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44779160618782043},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.43542999029159546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4045458137989044},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2893250584602356},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.139570951461792},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-03780-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03780-6_6","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":22,"referenced_works":["https://openalex.org/W1546311336","https://openalex.org/W1595291551","https://openalex.org/W1967576404","https://openalex.org/W1978707544","https://openalex.org/W1980288485","https://openalex.org/W1989076933","https://openalex.org/W1991055327","https://openalex.org/W1992573093","https://openalex.org/W2011039300","https://openalex.org/W2011823863","https://openalex.org/W2012130001","https://openalex.org/W2020112047","https://openalex.org/W2023370539","https://openalex.org/W2025002613","https://openalex.org/W2039298646","https://openalex.org/W2043916130","https://openalex.org/W2050428285","https://openalex.org/W2060380213","https://openalex.org/W2143095751","https://openalex.org/W2401610261","https://openalex.org/W3101686738","https://openalex.org/W4302604684"],"related_works":["https://openalex.org/W2081066931","https://openalex.org/W2518240130","https://openalex.org/W2943635264","https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W1595291551","https://openalex.org/W4244816249","https://openalex.org/W2183636263","https://openalex.org/W620960161","https://openalex.org/W2911818503"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}