{"id":"https://openalex.org/W2071218992","doi":"https://doi.org/10.1109/icnc.2012.6234531","title":"An improved distributed approximation algorithm for minimum connected dominating set","display_name":"An improved distributed approximation algorithm for minimum connected dominating set","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2071218992","doi":"https://doi.org/10.1109/icnc.2012.6234531","mag":"2071218992"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-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/A5047322924","display_name":"Shenyong Gao","orcid":"https://orcid.org/0000-0002-5385-7935"},"institutions":[{"id":"https://openalex.org/I4210119683","display_name":"Zhejiang Water Conservancy and Hydropower Survey and Design Institute","ror":"https://ror.org/02n6dhr29","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210119683"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shenyong Gao","raw_affiliation_strings":["Department of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China","Dept. of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China","institution_ids":["https://openalex.org/I4210119683"]},{"raw_affiliation_string":"Dept. of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China","institution_ids":["https://openalex.org/I4210119683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100386104","display_name":"Ying Zhang","orcid":"https://orcid.org/0000-0002-2674-1638"},"institutions":[{"id":"https://openalex.org/I4210119683","display_name":"Zhejiang Water Conservancy and Hydropower Survey and Design Institute","ror":"https://ror.org/02n6dhr29","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210119683"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ying Zhang","raw_affiliation_strings":["Department of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China","Dept. of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China","institution_ids":["https://openalex.org/I4210119683"]},{"raw_affiliation_string":"Dept. of Computer and Information Engineering, Zhejiang Water Conservancy and Hydropower College, Hangzhou, China","institution_ids":["https://openalex.org/I4210119683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047322924"],"corresponding_institution_ids":["https://openalex.org/I4210119683"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.16304451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1019","last_page":"1022"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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.9998000264167786,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9980999827384949,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980000257492065,"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/connected-dominating-set","display_name":"Connected dominating set","score":0.9009700417518616},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7366184592247009},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6995112895965576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6372426748275757},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5809560418128967},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5676456689834595},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5408298373222351},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48183193802833557},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.43752777576446533},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4233478903770447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3272342085838318},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2538911700248718},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.12982413172721863}],"concepts":[{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.9009700417518616},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7366184592247009},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6995112895965576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6372426748275757},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5809560418128967},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5676456689834595},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5408298373222351},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48183193802833557},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.43752777576446533},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4233478903770447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3272342085838318},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2538911700248718},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.12982413172721863},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1557449356","https://openalex.org/W1559599281","https://openalex.org/W2045349136","https://openalex.org/W2063572899","https://openalex.org/W2093381928","https://openalex.org/W2098502330","https://openalex.org/W2120170057","https://openalex.org/W2126976589","https://openalex.org/W2145797586"],"related_works":["https://openalex.org/W2662701","https://openalex.org/W2357985373","https://openalex.org/W2054473698","https://openalex.org/W2370165438","https://openalex.org/W1868459378","https://openalex.org/W2007607373","https://openalex.org/W3003924041","https://openalex.org/W4366983102","https://openalex.org/W3136251153","https://openalex.org/W4394796105"],"abstract_inverted_index":{"To":[0],"determine":[1],"the":[2,18,22,33,42,55],"minimum":[3],"connected":[4,27,48],"dominating":[5,49],"set":[6,50],"(MCDS)":[7],"in":[8,52],"wireless":[9],"networks,":[10],"an":[11],"improved":[12],"distributed":[13],"approximation":[14],"algorithm,":[15],"which":[16],"exploited":[17],"connectivity":[19],"information":[20,59],"within":[21],"2-hops":[23],"neighbors":[24],"to":[25],"select":[26],"points":[28],"and":[29,58],"taken":[30],"into":[31],"consideration":[32],"covering":[34],"relations,":[35],"is":[36],"presented.":[37],"Simulation":[38],"results":[39],"showed":[40],"that":[41],"proposed":[43],"algorithm":[44],"has":[45],"fairly":[46],"less":[47],"(CDS)":[51],"terms":[53],"of":[54],"time":[56],"complexity":[57],"complexity.":[60]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}