{"id":"https://openalex.org/W1986593951","doi":"https://doi.org/10.1007/s10878-014-9772-7","title":"On the clustered Steiner tree problem","display_name":"On the clustered Steiner tree problem","publication_year":2014,"publication_date":"2014-07-13","ids":{"openalex":"https://openalex.org/W1986593951","doi":"https://doi.org/10.1007/s10878-014-9772-7","mag":"1986593951"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-014-9772-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-014-9772-7","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","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/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, ROC","National Chung Cheng University, Chiayi, Taiwan, ROC 621#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Chung Cheng University, ChiaYi , 621, Taiwan, ROC","institution_ids":["https://openalex.org/I148099254"]},{"raw_affiliation_string":"National Chung Cheng University, Chiayi, Taiwan, ROC 621#TAB#","institution_ids":["https://openalex.org/I148099254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084197805","display_name":"Chen-Wan Lin","orcid":null},"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":false,"raw_author_name":"Chen-Wan Lin","raw_affiliation_strings":["National Chung Cheng University, ChiaYi , 621, Taiwan, ROC","National Chung Cheng University, Chiayi, Taiwan, ROC 621#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Chung Cheng University, ChiaYi , 621, Taiwan, ROC","institution_ids":["https://openalex.org/I148099254"]},{"raw_affiliation_string":"National Chung Cheng University, Chiayi, Taiwan, ROC 621#TAB#","institution_ids":["https://openalex.org/I148099254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012701826"],"corresponding_institution_ids":["https://openalex.org/I148099254"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":1.0602,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.76591707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"2","first_page":"370","last_page":"386"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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.9382219314575195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6936630606651306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.674225389957428},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.606505274772644},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5753869414329529},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5686123371124268},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5678958892822266},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5359156131744385},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5323657989501953},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.518787145614624},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5138905048370361},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4930886924266815},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4584403336048126},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4421304762363434},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.42757877707481384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41349706053733826},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.33044713735580444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24549371004104614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14627471566200256},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14258897304534912}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9382219314575195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6936630606651306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.674225389957428},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.606505274772644},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5753869414329529},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5686123371124268},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5678958892822266},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5359156131744385},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5323657989501953},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.518787145614624},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5138905048370361},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4930886924266815},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4584403336048126},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4421304762363434},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.42757877707481384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41349706053733826},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.33044713735580444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24549371004104614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14627471566200256},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14258897304534912},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-014-9772-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-014-9772-7","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9772-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-014-9772-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"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/W647522939","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/W2001352447","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/W2049184889","https://openalex.org/W2050428285","https://openalex.org/W2060380213","https://openalex.org/W2077016363","https://openalex.org/W2103515957","https://openalex.org/W2143095751","https://openalex.org/W2401610261","https://openalex.org/W2752885492","https://openalex.org/W3101686738","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4285719527","https://openalex.org/W4302604684"],"related_works":["https://openalex.org/W2081066931","https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W1595291551","https://openalex.org/W4244816249","https://openalex.org/W2183636263","https://openalex.org/W2999680961","https://openalex.org/W1992362850","https://openalex.org/W2050428285","https://openalex.org/W2096702260"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}