{"id":"https://openalex.org/W1503036335","doi":"https://doi.org/10.1007/3-540-44679-6_57","title":"The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points","display_name":"The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1503036335","doi":"https://doi.org/10.1007/3-540-44679-6_57","mag":"1503036335"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44679-6_57","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44679-6_57","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/A5037860988","display_name":"Ding\u2010Zhu Du","orcid":"https://orcid.org/0000-0002-7345-2185"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dingzhu Du","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Minnesota, MN, 55455, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Minnesota, MN, 55455, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065315257","display_name":"Lusheng Wang","orcid":"https://orcid.org/0000-0002-4344-8791"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lusheng Wang","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005438969","display_name":"Baogang Xu","orcid":"https://orcid.org/0000-0003-0435-6103"},"institutions":[{"id":"https://openalex.org/I4210120485","display_name":"Academy of Mathematics and Systems Science","ror":"https://ror.org/02jkmyk67","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210120485"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Baogang Xu","raw_affiliation_strings":["Institute of Systems Sciences, Academy of Math. & Systems Sciences, Beijing, 100080"],"affiliations":[{"raw_affiliation_string":"Institute of Systems Sciences, Academy of Math. & Systems Sciences, Beijing, 100080","institution_ids":["https://openalex.org/I4210120485"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037860988"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.7345,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.88554217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"509","last_page":"518"},"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.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"}},"topics":[{"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9912999868392944,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9764000177383423,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9900176525115967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8334534168243408},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.658279299736023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.599479615688324},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5882852077484131},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5341450572013855},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.49280861020088196},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.49136462807655334},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47915929555892944},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4615376889705658},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.44518372416496277},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.441629022359848},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4049196243286133},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.25982528924942017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2495022714138031},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.1399361491203308},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10489949584007263},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05396389961242676}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9900176525115967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8334534168243408},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.658279299736023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.599479615688324},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5882852077484131},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5341450572013855},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.49280861020088196},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.49136462807655334},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47915929555892944},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4615376889705658},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.44518372416496277},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.441629022359848},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4049196243286133},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.25982528924942017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2495022714138031},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.1399361491203308},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10489949584007263},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05396389961242676},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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.1007/3-540-44679-6_57","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44679-6_57","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":10,"referenced_works":["https://openalex.org/W1525228936","https://openalex.org/W1533142511","https://openalex.org/W1998126097","https://openalex.org/W2069002708","https://openalex.org/W2122877872","https://openalex.org/W2123796580","https://openalex.org/W2145965938","https://openalex.org/W2148678019","https://openalex.org/W2161071733","https://openalex.org/W2171603211"],"related_works":["https://openalex.org/W3187208706","https://openalex.org/W1997570556","https://openalex.org/W2183553443","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W2949081670","https://openalex.org/W1576317141","https://openalex.org/W2117879716","https://openalex.org/W2068598660","https://openalex.org/W2793974038"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}