{"id":"https://openalex.org/W1497398712","doi":"https://doi.org/10.1007/978-3-540-85097-7_26","title":"Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs","display_name":"Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs","publication_year":2008,"publication_date":"2008-08-19","ids":{"openalex":"https://openalex.org/W1497398712","doi":"https://doi.org/10.1007/978-3-540-85097-7_26","mag":"1497398712"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-85097-7_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85097-7_26","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/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","Department of Computer Science, University of Texas at Dallas, Richardson 75080#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson 75080#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"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"]},{"id":"https://openalex.org/I4210152533","display_name":"Lanzhou University of Finance and Economics","ror":"https://ror.org/04v7yv031","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210152533"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xianyue Li","raw_affiliation_strings":["School of Mathematics and Statistics, Lanzhou University, Lanzhou, P.R. China","School of Mathematics and Statistics, Lanzhou University, Lanzhou, P.R. China 730000"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Lanzhou University, Lanzhou, P.R. China","institution_ids":["https://openalex.org/I4210152533"]},{"raw_affiliation_string":"School of Mathematics and Statistics, Lanzhou University, Lanzhou, P.R. China 730000","institution_ids":["https://openalex.org/I76214153"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100454659","display_name":"Dong\u2010Hyun Kim","orcid":"https://orcid.org/0000-0001-9807-4064"},"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":"Donghyun Kim","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson","Department of Computer Science, University of Texas at Dallas, Richardson 75080#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson 75080#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"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","Department of Computer Science, University of Texas at Dallas, Richardson 75080#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson 75080#TAB#","institution_ids":["https://openalex.org/I162577319"]}]}],"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":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3039,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.85802733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"278","last_page":"285"},"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.9994000196456909,"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.9994000196456909,"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.9977999925613403,"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.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8260324001312256},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7635221481323242},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7175429463386536},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.692380428314209},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6018698811531067},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.5476065278053284},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5467764139175415},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5215592384338379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5042039155960083},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49579963088035583},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4910848140716553},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4837496280670166},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.464255154132843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41567739844322205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4034702181816101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3222266137599945},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2442811131477356},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17565223574638367},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.12239497900009155},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.0812302827835083}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8260324001312256},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7635221481323242},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7175429463386536},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.692380428314209},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6018698811531067},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.5476065278053284},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5467764139175415},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5215592384338379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5042039155960083},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49579963088035583},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4910848140716553},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4837496280670166},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.464255154132843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41567739844322205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4034702181816101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3222266137599945},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2442811131477356},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17565223574638367},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.12239497900009155},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0812302827835083},{"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/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.0},{"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-85097-7_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85097-7_26","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"},{"id":"pmh:oai:ir.lzu.edu.cn/:262010/185050","is_oa":false,"landing_page_url":"http://ir.lzu.edu.cn/handle/262010/185050","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"\u4f1a\u8bae\u8bba\u6587"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.9673","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.9673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~dhk051000/pub/2008COCOA.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":20,"referenced_works":["https://openalex.org/W1963899113","https://openalex.org/W1967641001","https://openalex.org/W1974888782","https://openalex.org/W1975290397","https://openalex.org/W1983607113","https://openalex.org/W1990317614","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/W2024884029","https://openalex.org/W2047723482","https://openalex.org/W2063726026","https://openalex.org/W2078008627","https://openalex.org/W2115616619","https://openalex.org/W2140951480","https://openalex.org/W2143996311","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2022082910","https://openalex.org/W2416485279","https://openalex.org/W2388345276","https://openalex.org/W4390041237","https://openalex.org/W2391238671","https://openalex.org/W2739148461","https://openalex.org/W1530712874","https://openalex.org/W2093381928","https://openalex.org/W3037291746","https://openalex.org/W4226332489"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}