{"id":"https://openalex.org/W2001352447","doi":"https://doi.org/10.1007/s10878-009-9229-6","title":"Node-weighted Steiner tree approximation in\u00a0unit disk\u00a0graphs","display_name":"Node-weighted Steiner tree approximation in\u00a0unit disk\u00a0graphs","publication_year":2009,"publication_date":"2009-05-20","ids":{"openalex":"https://openalex.org/W2001352447","doi":"https://doi.org/10.1007/s10878-009-9229-6","mag":"2001352447"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-009-9229-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-009-9229-6","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":true,"oa_status":"green","oa_url":"http://ir.lzu.edu.cn/handle/262010/118245","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029410135","display_name":"Feng Zou","orcid":"https://orcid.org/0000-0001-5373-8779"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Feng Zou","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA","University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101765977","display_name":"Xianyue Li","orcid":"https://orcid.org/0000-0002-6311-8888"},"institutions":[{"id":"https://openalex.org/I76214153","display_name":"Lanzhou University","ror":"https://ror.org/01mkqqe32","country_code":"CN","type":"education","lineage":["https://openalex.org/I76214153"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xianyue Li","raw_affiliation_strings":["School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu, 730000, China","[Lanzhou University]"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu, 730000, China","institution_ids":["https://openalex.org/I76214153"]},{"raw_affiliation_string":"[Lanzhou University]","institution_ids":["https://openalex.org/I76214153"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040404158","display_name":"Suogang Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I94611258","display_name":"Hebei Normal University","ror":"https://ror.org/004rbbw49","country_code":"CN","type":"education","lineage":["https://openalex.org/I94611258"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Suogang Gao","raw_affiliation_strings":["Math. and Inf. College, Hebei Normal University, Shijiazhuang, 050016, China","Hebei Normal University;"],"affiliations":[{"raw_affiliation_string":"Math. and Inf. College, Hebei Normal University, Shijiazhuang, 050016, China","institution_ids":["https://openalex.org/I94611258"]},{"raw_affiliation_string":"Hebei Normal University;","institution_ids":["https://openalex.org/I94611258"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070037321","display_name":"Weili Wu","orcid":"https://orcid.org/0000-0001-8747-6340"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weili Wu","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA","University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029410135"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":7.0764,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.97298348,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"18","issue":"4","first_page":"342","last_page":"349"},"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.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9957000017166138,"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/combinatorics","display_name":"Combinatorics","score":0.7804586291313171},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.7787350416183472},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7530341148376465},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7061443328857422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6956888437271118},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.6309570074081421},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6214339137077332},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5733823776245117},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5201342701911926},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5138433575630188},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5094903111457825},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5021746158599854},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.47065606713294983},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45174384117126465},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.44196557998657227},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4312279224395752},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.4219953715801239},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4033159911632538},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3526390492916107},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.22905254364013672},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.18560978770256042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15650737285614014},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1442543864250183},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14150983095169067},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13481226563453674}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7804586291313171},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.7787350416183472},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7530341148376465},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7061443328857422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6956888437271118},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.6309570074081421},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6214339137077332},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5733823776245117},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5201342701911926},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5138433575630188},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5094903111457825},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5021746158599854},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.47065606713294983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45174384117126465},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.44196557998657227},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4312279224395752},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.4219953715801239},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4033159911632538},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3526390492916107},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.22905254364013672},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.18560978770256042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15650737285614014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1442543864250183},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14150983095169067},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13481226563453674},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-009-9229-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-009-9229-6","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:ir.lzu.edu.cn/:262010/118245","is_oa":true,"landing_page_url":"http://ir.lzu.edu.cn/handle/262010/118245","pdf_url":null,"source":{"id":"https://openalex.org/S4406923049","display_name":"Lanzhou University Institutional Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:18:y:2009:i:4:d:10.1007_s10878-009-9229-6","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-009-9229-6","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":{"id":"pmh:oai:ir.lzu.edu.cn/:262010/118245","is_oa":true,"landing_page_url":"http://ir.lzu.edu.cn/handle/262010/118245","pdf_url":null,"source":{"id":"https://openalex.org/S4406923049","display_name":"Lanzhou University Institutional Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1572977974","https://openalex.org/W1963899113","https://openalex.org/W1975290397","https://openalex.org/W1983607113","https://openalex.org/W1990327548","https://openalex.org/W2003882909","https://openalex.org/W2007503572","https://openalex.org/W2008771115","https://openalex.org/W2011039300","https://openalex.org/W2012130001","https://openalex.org/W2047723482","https://openalex.org/W2053079614","https://openalex.org/W2063726026","https://openalex.org/W2078008627","https://openalex.org/W2115616619","https://openalex.org/W2140951480","https://openalex.org/W2142455346","https://openalex.org/W2143996311","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2404860882","https://openalex.org/W2524248915","https://openalex.org/W2388345276","https://openalex.org/W2584896874","https://openalex.org/W1544556059","https://openalex.org/W2248932017","https://openalex.org/W1591155714","https://openalex.org/W2346310971","https://openalex.org/W2373163715","https://openalex.org/W2148494283"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":14}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}