{"id":"https://openalex.org/W1983607113","doi":"https://doi.org/10.1016/s0304-3975(00)00182-1","title":"Approximations for Steiner trees with minimum number of Steiner points","display_name":"Approximations for Steiner trees with minimum number of Steiner points","publication_year":2001,"publication_date":"2001-07-01","ids":{"openalex":"https://openalex.org/W1983607113","doi":"https://doi.org/10.1016/s0304-3975(00)00182-1","mag":"1983607113"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(00)00182-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00182-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5090458535","display_name":"Dong\u2010Hui Chen","orcid":"https://orcid.org/0000-0003-2561-2444"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Donghui Chen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111500150","display_name":"Ding\u2010Zhu Du","orcid":null},"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"]},{"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"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]}],"countries":["CN","HK","US"],"is_corresponding":false,"raw_author_name":"Ding-Zhu Du","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA","Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China","institution_ids":["https://openalex.org/I19820366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050750924","display_name":"Xiao Hu","orcid":"https://orcid.org/0000-0003-1128-4099"},"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"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]}],"countries":["CN","HK"],"is_corresponding":false,"raw_author_name":"Xiao-Dong Hu","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China","institution_ids":["https://openalex.org/I19820366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089344475","display_name":"Guohui Lin","orcid":"https://orcid.org/0000-0003-4283-3396"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guo-Hui Lin","raw_affiliation_strings":["Department of Computer Science, The University of Vermont, Burlington, VT 05405, USA","UNIVERSITY OF VERMONT"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Vermont, Burlington, VT 05405, USA","institution_ids":["https://openalex.org/I111236770"]},{"raw_affiliation_string":"UNIVERSITY OF VERMONT","institution_ids":["https://openalex.org/I111236770"]}]},{"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 Tong, Hong Kong","City University of Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"City University of Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["Department of Computer Science, The University of Vermont, Burlington, VT 05405, USA","UNIVERSITY OF VERMONT"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Vermont, Burlington, VT 05405, USA","institution_ids":["https://openalex.org/I111236770"]},{"raw_affiliation_string":"UNIVERSITY OF VERMONT","institution_ids":["https://openalex.org/I111236770"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5090458535"],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.876,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.75198421,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"262","issue":"1-2","first_page":"83","last_page":"99"},"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.9995999932289124,"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.9995999932289124,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9621062278747559},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7265002727508545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7200061678886414},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6248798370361328},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.615125298500061},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5895859599113464},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5727565884590149},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5550061464309692},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5473664999008179},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5033802390098572},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.49688342213630676},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4940035939216614},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.480866014957428},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44174355268478394},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.41981613636016846},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.16040709614753723},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14647075533866882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13983306288719177},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0765489935874939},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07632681727409363}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9621062278747559},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7265002727508545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7200061678886414},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6248798370361328},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.615125298500061},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5895859599113464},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5727565884590149},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5550061464309692},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5473664999008179},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5033802390098572},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.49688342213630676},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4940035939216614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.480866014957428},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44174355268478394},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.41981613636016846},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.16040709614753723},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14647075533866882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13983306288719177},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0765489935874939},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07632681727409363},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0304-3975(00)00182-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00182-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.1175","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.1175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umn.edu/research/mobile/seminar/SPRING03/WNfiles/ast.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.462.6117","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.462.6117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://optimization.asu.edu/~xue/papers/JOGO2000-RelayNode.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W1479863711","https://openalex.org/W1570063718","https://openalex.org/W1974811277","https://openalex.org/W1981466335","https://openalex.org/W2024833542","https://openalex.org/W2039915021","https://openalex.org/W2042492403","https://openalex.org/W2060380213","https://openalex.org/W2069002708","https://openalex.org/W2086709935","https://openalex.org/W2100961486","https://openalex.org/W2110367141","https://openalex.org/W2114753568","https://openalex.org/W2122877872","https://openalex.org/W2123796580","https://openalex.org/W2128456629","https://openalex.org/W2145965938","https://openalex.org/W2171554063"],"related_works":["https://openalex.org/W2518240130","https://openalex.org/W3016811403","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2130375301","https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W2400989246","https://openalex.org/W4308416203","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}