{"id":"https://openalex.org/W2519803304","doi":"https://doi.org/10.1109/icccn.2016.7568483","title":"A Simpler Constant Factor Approximation for the k-Connected m-Domination Set Problem in Unit Disk Graph","display_name":"A Simpler Constant Factor Approximation for the k-Connected m-Domination Set Problem in Unit Disk Graph","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2519803304","doi":"https://doi.org/10.1109/icccn.2016.7568483","mag":"2519803304"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2016.7568483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2016.7568483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 25th International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5114910830","display_name":"Bei Liu","orcid":"https://orcid.org/0000-0002-6208-003X"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bei Liu","raw_affiliation_strings":["School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, China","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116337743","display_name":"Wei Wang","orcid":"https://orcid.org/0000-0002-2411-7399"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Wang","raw_affiliation_strings":["School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, China","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100454675","display_name":"Donghyun Kim","orcid":"https://orcid.org/0000-0002-4845-9369"},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Donghyun Kim","raw_affiliation_strings":["Department of Computer Science, Kennesaw State University, Marietta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kennesaw State University, Marietta, GA, USA","institution_ids":["https://openalex.org/I172980758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046635673","display_name":"Yingshu Li","orcid":"https://orcid.org/0000-0002-1906-7112"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yingshu Li","raw_affiliation_strings":["Department of Computer Science, Georgia State University, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, Atlanta, GA, USA","institution_ids":["https://openalex.org/I181565077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072056882","display_name":"Sung-Sik Kwon","orcid":"https://orcid.org/0000-0002-3216-5702"},"institutions":[{"id":"https://openalex.org/I123127086","display_name":"North Carolina Central University","ror":"https://ror.org/051r3tx83","country_code":"US","type":"education","lineage":["https://openalex.org/I123127086"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sung-Sik Kwon","raw_affiliation_strings":["Department of Mathematics and Physics, North Carolina Central University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, North Carolina Central University, Durham, NC, USA","institution_ids":["https://openalex.org/I123127086"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"173","issue":null,"first_page":"1","last_page":"8"},"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.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"}},{"id":"https://openalex.org/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7102388143539429},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6306867003440857},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.6280739307403564},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.561363935470581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5221835970878601},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.504423975944519},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49846744537353516},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.48441082239151},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4579452872276306},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4184824526309967},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.413227379322052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3845593333244324},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37924817204475403},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.32929527759552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30971264839172363}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7102388143539429},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6306867003440857},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.6280739307403564},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.561363935470581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5221835970878601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.504423975944519},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49846744537353516},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.48441082239151},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4579452872276306},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4184824526309967},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.413227379322052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3845593333244324},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37924817204475403},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.32929527759552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30971264839172363},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2016.7568483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2016.7568483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 25th International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5099999904632568,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W1483823870","https://openalex.org/W1504925519","https://openalex.org/W1509326639","https://openalex.org/W1544556059","https://openalex.org/W1556467681","https://openalex.org/W1986129901","https://openalex.org/W1986677022","https://openalex.org/W1987990114","https://openalex.org/W1993760660","https://openalex.org/W1994188228","https://openalex.org/W2011806775","https://openalex.org/W2012872086","https://openalex.org/W2014550373","https://openalex.org/W2038841453","https://openalex.org/W2043377742","https://openalex.org/W2045349136","https://openalex.org/W2047496769","https://openalex.org/W2052656799","https://openalex.org/W2085887452","https://openalex.org/W2093056188","https://openalex.org/W2098086554","https://openalex.org/W2098502330","https://openalex.org/W2105144880","https://openalex.org/W2107505910","https://openalex.org/W2120170057","https://openalex.org/W2126976589","https://openalex.org/W2129588702","https://openalex.org/W2130403046","https://openalex.org/W2136598608","https://openalex.org/W2146050380","https://openalex.org/W2146640241","https://openalex.org/W2147965035","https://openalex.org/W2165436580","https://openalex.org/W2166329551","https://openalex.org/W2167015577","https://openalex.org/W2193352331","https://openalex.org/W2277067308","https://openalex.org/W2488526152","https://openalex.org/W2495194492","https://openalex.org/W2524248915","https://openalex.org/W2535034678","https://openalex.org/W3039948875","https://openalex.org/W3043060850","https://openalex.org/W3125173622","https://openalex.org/W3141863997","https://openalex.org/W4243479188","https://openalex.org/W6630634758","https://openalex.org/W6659939358","https://openalex.org/W6661245368","https://openalex.org/W6676382710","https://openalex.org/W6694880759","https://openalex.org/W6727127801","https://openalex.org/W6728644916","https://openalex.org/W6966869470"],"related_works":["https://openalex.org/W1094435092","https://openalex.org/W2901677255","https://openalex.org/W2404860882","https://openalex.org/W2524248915","https://openalex.org/W2388345276","https://openalex.org/W4289244352","https://openalex.org/W2397211304","https://openalex.org/W318309967","https://openalex.org/W2093381928","https://openalex.org/W2015228704"],"abstract_inverted_index":{"Over":[0],"years,":[1],"many":[2],"efforts":[3],"are":[4,66,126],"made":[5],"for":[6,75,109,153],"the":[7,31,44,48,53,60,110,121,124,154,204,221,235,241],"problem":[8,49,58,78,111,155],"of":[9,25,123,206,237],"constructing":[10],"quality":[11],"fault-tolerant":[12],"virtual":[13],"backbones":[14],"in":[15,140],"wireless":[16,22,45],"network.":[17],"In":[18],"case":[19],"that":[20,220],"a":[21,70,149,173,214,231],"network":[23,46],"consists":[24],"physically":[26],"equivalent":[27],"nodes,":[28],"e.g.":[29],"with":[30,112,156,188],"same":[32],"communication":[33],"range,":[34],"unit":[35],"disk":[36],"graph":[37,200],"(UDG)":[38],"is":[39,50,164,224,230,248],"widely":[40],"used":[41],"to":[42,135,202,218,251],"abstract":[43],"and":[47,84,92,101,129,137,178,196,226,244,253],"formulated":[51],"as":[52],"minimum":[54],"k-connected":[55],"mdominating":[56],"set":[57,176],"on":[59,68,166],"UDG.":[61],"So":[62],"far,":[63],"most":[64],"results":[65],"focused":[67],"designing":[69],"constant":[71,105],"factor":[72,106],"approximation":[73,107,151,228],"algorithm":[74,152,163,223,239,247],"this":[76,146,199],"NP-hard":[77],"under":[79],"two":[80],"positive":[81],"integers":[82],"k":[83,89,93,115,159],"m":[85,87,113,157],"satisfying":[86],"\u2265":[88,90,114,116,158,160],"1":[91],"\u2264":[94],"3.":[95],"Very":[96],"recently,":[97],"Shi":[98],"et.":[99],"al.":[100],"Fukunaga":[102],"separately":[103],"introduced":[104],"algorithms":[108,125],"1.":[117,161],"However,":[118],"we":[119],"found":[120],"structures":[122],"extremely":[127],"complicated,":[128],"thus":[130],"it":[131],"would":[132],"be":[133],"difficult":[134],"implement":[136],"use":[138,198],"them":[139],"practice.":[141],"Motivated":[142],"by":[143],"such":[144],"observation,":[145],"paper":[147],"introduces":[148],"novel":[150],"This":[162],"based":[165],"our":[167,238,246],"new":[168],"technique":[169],"which":[170],"first":[171],"computes":[172],"1-connected":[174],"m-dominating":[175],"D":[177,182,209],"repeatedly":[179],"(a)":[180],"decomposes":[181],"into":[183],"an":[184],"i-connected":[185],"block":[186],"tree,":[187],"i":[189],"=":[190],"2,":[191],"3,":[192],"\u00b7\u00b7\u00b7":[193],",":[194],"k,":[195],"(b)":[197],"structure":[201,236],"improve":[203],"connectivity":[205],"D,":[207],"until":[208],"becomes":[210],"k-connected.":[211],"We":[212,233],"provide":[213],"rigorous":[215],"theoretical":[216],"analysis":[217],"prove":[219],"proposed":[222],"correct":[225],"its":[227],"ratio":[229],"constant.":[232],"compare":[234],"against":[240],"existing":[242],"ones":[243],"show":[245],"much":[249],"simpler":[250],"understand":[252],"implement.":[254]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}