{"id":"https://openalex.org/W2537099718","doi":"https://doi.org/10.1002/net.21713","title":"The bottleneck selected\u2010internal and partial terminal Steiner tree problems","display_name":"The bottleneck selected\u2010internal and partial terminal Steiner tree problems","publication_year":2016,"publication_date":"2016-10-19","ids":{"openalex":"https://openalex.org/W2537099718","doi":"https://doi.org/10.1002/net.21713","mag":"2537099718"},"language":"en","primary_location":{"id":"doi:10.1002/net.21713","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21713","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5109039446","display_name":"Yen Hung Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I22442739","display_name":"University of Taipei","ror":"https://ror.org/039e7bg24","country_code":"TW","type":"education","lineage":["https://openalex.org/I22442739"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yen Hung Chen","raw_affiliation_strings":["Department of Computer Science University of Taipei No.1, Ai\u2010Guo West Road Taipei 10048 Taiwan","Department of Computer Science, University of Taipei, No.1, Ai-Guo West Road, Taipei, 10048 Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Taipei No.1, Ai\u2010Guo West Road Taipei 10048 Taiwan","institution_ids":["https://openalex.org/I22442739"]},{"raw_affiliation_string":"Department of Computer Science, University of Taipei, No.1, Ai-Guo West Road, Taipei, 10048 Taiwan","institution_ids":["https://openalex.org/I22442739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109039446"],"corresponding_institution_ids":["https://openalex.org/I22442739"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.186,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.59379903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"68","issue":"4","first_page":"331","last_page":"339"},"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.9994999766349792,"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.9994999766349792,"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.9991000294685364,"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.998199999332428,"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.9308278560638428},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8391901850700378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.742375373840332},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6717790961265564},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5809711217880249},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.526298999786377},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4927230179309845},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47614264488220215},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4621904790401459},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4568089544773102},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.41996386647224426},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3283514976501465},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2786898612976074},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.18835943937301636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1484609842300415}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9308278560638428},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8391901850700378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.742375373840332},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6717790961265564},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5809711217880249},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.526298999786377},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4927230179309845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47614264488220215},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4621904790401459},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4568089544773102},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.41996386647224426},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3283514976501465},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2786898612976074},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.18835943937301636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1484609842300415},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.21713","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21713","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G71493912","display_name":null,"funder_award_id":"NSC 100-2221-E-133-002","funder_id":"https://openalex.org/F4320321040","funder_display_name":"National Science Council"}],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W76732495","https://openalex.org/W1558703235","https://openalex.org/W1595291551","https://openalex.org/W1967576404","https://openalex.org/W1970505537","https://openalex.org/W1976584101","https://openalex.org/W1980288485","https://openalex.org/W1989076933","https://openalex.org/W1992573093","https://openalex.org/W1993715180","https://openalex.org/W1998126097","https://openalex.org/W2003882909","https://openalex.org/W2012130001","https://openalex.org/W2014153423","https://openalex.org/W2023370539","https://openalex.org/W2025002613","https://openalex.org/W2030693014","https://openalex.org/W2032228390","https://openalex.org/W2039298646","https://openalex.org/W2050428285","https://openalex.org/W2056824842","https://openalex.org/W2060380213","https://openalex.org/W2069002708","https://openalex.org/W2070664846","https://openalex.org/W2070817156","https://openalex.org/W2078008627","https://openalex.org/W2122877872","https://openalex.org/W2123796580","https://openalex.org/W2143095751","https://openalex.org/W2145965938","https://openalex.org/W2150253898","https://openalex.org/W2172222998","https://openalex.org/W2176547441","https://openalex.org/W2317079499","https://openalex.org/W3215504420","https://openalex.org/W4230433235","https://openalex.org/W4230895240","https://openalex.org/W4246219036","https://openalex.org/W4256302751"],"related_works":["https://openalex.org/W1584380088","https://openalex.org/W3016811403","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W1576317141","https://openalex.org/W2911818503","https://openalex.org/W2582147058","https://openalex.org/W4390962175","https://openalex.org/W2071845176","https://openalex.org/W2039611868"],"abstract_inverted_index":{"Given":[0],"a":[1,5,45,59,106,121,165,180],"complete":[2,181],"graph":[3,182],",":[4,20,168,206],"positive":[6],"length":[7,72,135],"function":[8,220],"on":[9,176,241],"edges,":[10],"and":[11,17,66,129,183],"two":[12],"subsets":[13],"R":[14,19,38,65,99,128],"of":[15,18,32,47,73,93,108,136,186,221,232,250],"V":[16],"the":[21,48,71,74,109,134,137,150,170,184,189,208,235,253],"selected\u2010internal":[22,52,60,152,172,210,237],"Steiner":[23,53,61,84,115,124,153,173,211,238,257],"tree":[24,54,62,85,116,125,154,174,212,239,258],"is":[25,44,56,79,86,105,118,142,156,164,202,217],"defined":[26,87],"to":[27,57,88,119,197],"be":[28,89],"an":[29,90,203,226,247],"acyclic":[30,91],"subgraph":[31,92],"G":[33,68,94,131],"spanning":[34,95],"all":[35,96],"vertices":[36,97],"in":[37,43,67,77,98,104,130,140],"such":[39,69,100,132],"that":[40,70,101,133,149,161,199],"no":[41],"vertex":[42,103],"leaf":[46,107],"subgraph.":[49,110],"The":[50,81,111],"bottleneck":[51,112,151,171,209,236,254],"problem":[55,117,155,175,240],"find":[58,120],"T":[63,78,126,141],"for":[64,127,169,207,234,252],"largest":[75,138],"edge":[76,139],"minimized.":[80,143],"partial":[82,113,122,255],"terminal":[83,114,123,256],"each":[102],"In":[144],"this":[145],"article,":[146],"we":[147,195,224,245],"show":[148,160,198],"NP\u2010complete.":[157],"We":[158],"also":[159],"if":[162,200],"there":[163,201],"\u2010approximation":[166,204],"algorithm,":[167,205],"metric":[177,242],"graphs":[178],"(i.e.,":[179],"lengths":[185],"edges":[187],"satisfy":[188],"triangle":[190],"inequality),":[191],"then":[192,214],"P=NP.":[193],"Then":[194],"extend":[196],"problem,":[213],"P=NP,":[215],"where":[216],"any":[218],"computable":[219],".":[222],"Moreover,":[223],"present":[225,246],"approximation":[227],"algorithm":[228,249],"with":[229],"performance":[230],"ratio":[231],"3":[233],"graphs.":[243],"Finally,":[244],"exact":[248],"time":[251],"problem.":[259],"\u00a9":[260],"2016":[261,269],"Wiley":[262],"Periodicals,":[263],"Inc.":[264],"NETWORKS,":[265],"Vol.":[266],"68(4),":[267],"331\u2013339":[268]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-30T09:15:22.047038","created_date":"2025-10-10T00:00:00"}