{"id":"https://openalex.org/W2103050160","doi":"https://doi.org/10.1007/s10878-013-9626-8","title":"PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs","display_name":"PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs","publication_year":2013,"publication_date":"2013-05-22","ids":{"openalex":"https://openalex.org/W2103050160","doi":"https://doi.org/10.1007/s10878-013-9626-8","mag":"2103050160"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-013-9626-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9626-8","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073970841","display_name":"Lidong Wu","orcid":"https://orcid.org/0000-0001-5714-1398"},"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":"Lidong Wu","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA","Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080#TAB#"],"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":"Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077298638","display_name":"Hongwei Du","orcid":"https://orcid.org/0000-0002-5312-4037"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongwei Du","raw_affiliation_strings":["Department of Computer Science and Technology, Shenzhen Key Laboratory of Internet Information Collaboration, Harbin Institute of Technology, Shenzhen Graduate School, Shenzhen, 518055, China","Department of Computer Science and Technology, Shenzhen Key Laboratory of Internet Information Collaboration, Harbin Institute of Technology, Shenzhen Graduate School, Shenzhen, China 518055#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Shenzhen Key Laboratory of Internet Information Collaboration, Harbin Institute of Technology, Shenzhen Graduate School, Shenzhen, 518055, China","institution_ids":["https://openalex.org/I204983213"]},{"raw_affiliation_string":"Department of Computer Science and Technology, Shenzhen Key Laboratory of Internet Information Collaboration, Harbin Institute of Technology, Shenzhen Graduate School, Shenzhen, China 518055#TAB#","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","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","Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080#TAB#"],"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":"Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101916193","display_name":"Yuqing Zhu","orcid":"https://orcid.org/0000-0002-4087-4461"},"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":"Yuqing Zhu","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA","Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080#TAB#"],"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":"Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065618084","display_name":"Ai-lan Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ailan Wang","raw_affiliation_strings":["Department of Computer Science and Technology, Taiyuan University of Technology, Shanxi, 030024, China","Department of Computer Science and Technology, Taiyuan University of Technology, Shanxi, China 030024#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Taiyuan University of Technology, Shanxi, 030024, China","institution_ids":["https://openalex.org/I9086337"]},{"raw_affiliation_string":"Department of Computer Science and Technology, Taiyuan University of Technology, Shanxi, China 030024#TAB#","institution_ids":["https://openalex.org/I9086337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100602693","display_name":"Wonjun Lee","orcid":"https://orcid.org/0000-0001-5286-6541"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Wonjun Lee","raw_affiliation_strings":["Department of Computer Science and Engineering, Korea University, Seoul, South Korea","Department of Computer Science and Engineering, Korea University Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Korea University Seoul, South Korea","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5073970841"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.7597,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.77189783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"1","first_page":"18","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9958999752998352,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9954000115394592,"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/connected-dominating-set","display_name":"Connected dominating set","score":0.774611234664917},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.7188575267791748},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.5928371548652649},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5838386416435242},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5662436485290527},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5587438941001892},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.507862389087677},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5031315684318542},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44136565923690796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42386671900749207},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4217527508735657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3944731652736664},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2687850594520569},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19137239456176758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1453138291835785}],"concepts":[{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.774611234664917},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.7188575267791748},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.5928371548652649},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5838386416435242},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5662436485290527},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5587438941001892},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.507862389087677},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5031315684318542},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44136565923690796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42386671900749207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4217527508735657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3944731652736664},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2687850594520569},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19137239456176758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1453138291835785},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-013-9626-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9626-8","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:RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9626-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-013-9626-8","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":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W603975761","https://openalex.org/W1576353514","https://openalex.org/W1987818736","https://openalex.org/W2059655733","https://openalex.org/W2074008775","https://openalex.org/W2100806474","https://openalex.org/W2104278842","https://openalex.org/W2104644569","https://openalex.org/W2117331508","https://openalex.org/W2147926631","https://openalex.org/W2156760067","https://openalex.org/W2162804590","https://openalex.org/W2167609596","https://openalex.org/W2435603672","https://openalex.org/W2475896510","https://openalex.org/W4253935083","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W3188033804","https://openalex.org/W4251029343","https://openalex.org/W2100496711","https://openalex.org/W2397211304","https://openalex.org/W2169848785","https://openalex.org/W3141863997","https://openalex.org/W3151869678","https://openalex.org/W2043936605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}