{"id":"https://openalex.org/W2998735198","doi":"https://doi.org/10.1137/18m1212094","title":"Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems","display_name":"Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2998735198","doi":"https://doi.org/10.1137/18m1212094","mag":"2998735198"},"language":"en","primary_location":{"id":"doi:10.1137/18m1212094","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1212094","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054974601","display_name":"Manish Purohit","orcid":"https://orcid.org/0000-0002-8650-2022"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manish Purohit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047410299","display_name":"Kanthi Sarpatwar","orcid":"https://orcid.org/0000-0002-7737-1200"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kanthi K. Sarpatwar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6576,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.87184783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"34","issue":"1","first_page":"251","last_page":"270"},"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.9998999834060669,"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.9998999834060669,"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.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9937999844551086,"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/submodular-set-function","display_name":"Submodular set function","score":0.8238695859909058},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7463396191596985},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.7082251906394958},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6908369660377502},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6539023518562317},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6326242089271545},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5677956938743591},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4918675422668457},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.4894620180130005},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48303088545799255},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4694000780582428},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4565768241882324},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43832144141197205},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.41584512591362},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4101945757865906},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39328283071517944},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.315650075674057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15451163053512573},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.07025054097175598}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8238695859909058},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7463396191596985},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.7082251906394958},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6908369660377502},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6539023518562317},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6326242089271545},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5677956938743591},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4918675422668457},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.4894620180130005},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48303088545799255},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4694000780582428},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4565768241882324},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43832144141197205},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.41584512591362},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4101945757865906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39328283071517944},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.315650075674057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15451163053512573},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.07025054097175598},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1212094","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1212094","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6167569505","display_name":null,"funder_award_id":"CCF 0937865","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8174123836","display_name":null,"funder_award_id":"CCF 1217890","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1973264045","https://openalex.org/W1975361422","https://openalex.org/W1981982709","https://openalex.org/W1992338191","https://openalex.org/W2014979132","https://openalex.org/W2015706819","https://openalex.org/W2022082910","https://openalex.org/W2029828838","https://openalex.org/W2044028871","https://openalex.org/W2080379754","https://openalex.org/W2098502330","https://openalex.org/W2112112676","https://openalex.org/W2143996311","https://openalex.org/W2147258429","https://openalex.org/W2155148197","https://openalex.org/W2178856181","https://openalex.org/W3141863997"],"related_works":["https://openalex.org/W2952019673","https://openalex.org/W1995707367","https://openalex.org/W2358533445","https://openalex.org/W1497312391","https://openalex.org/W2383959219","https://openalex.org/W136930855","https://openalex.org/W3095613880","https://openalex.org/W4360610866","https://openalex.org/W1484268536","https://openalex.org/W3047700137"],"abstract_inverted_index":{"We":[0,58,93,140],"study":[1],"partial":[2,15,209],"and":[3,30,34,52,81,129,203,210,245],"budgeted":[4,112,211],"versions":[5,212,248],"of":[6,43,50,79,97,124,169,213,227,249],"the":[7,14,35,60,77,88,98,111,122,130,162,179,201,208,217,221,228,250,257],"well-studied":[8],"connected":[9,16,48,89,113,180],"dominating":[10,17,90,114,181],"set":[11,18,91,115,182,230],"problem.":[12,92,109,148,263],"In":[13,110],"(PCDS)":[19],"problem,":[20,73,116],"we":[21,126,150,240],"are":[22,219,253],"given":[23],"an":[24,31,66,194],"undirected":[25],"graph":[26],"$G":[27],"=":[28],"(V,E)$":[29],"integer":[32],"$n'$,":[33],"goal":[36,131],"is":[37,118,132,171],"to":[38,106,133,156],"find":[39],"a":[40,47,119,142,157,167,172,224,235],"minimum":[41],"subset":[42,168],"vertices":[44,125,137,170],"that":[45,95,152,242],"induces":[46],"subgraph":[49],"$G$":[51],"dominates":[53],"at":[54],"least":[55],"$n'$":[56],"vertices.":[57],"obtain":[59,141],"first":[61],"polynomial":[62],"time":[63],"algorithm":[64,145],"with":[65,166,184],"$O(\\ln":[67,195],"\\Delta)$":[68],"approximation":[69,144,197,205],"guarantee":[70],"for":[71,87,146,207],"this":[72,108,147],"thereby":[74],"significantly":[75],"extending":[76],"results":[78,222],"Guha":[80],"Khuller":[82],"[Algorithmica,":[83],"20(1998),":[84],"pp.":[85],"374--387]":[86],"note":[94],"none":[96],"methods":[99],"developed":[100],"earlier":[101],"can":[102,127],"be":[103],"applied":[104],"directly":[105],"solve":[107],"there":[117],"budget":[120],"on":[121],"number":[123],"select,":[128],"dominate":[134],"as":[135,138,189,254,256],"many":[136],"possible.":[139],"$\\frac{1}{12}(1-\\frac{1}{e})$":[143],"Finally,":[149,239],"show":[151],"our":[153],"techniques":[154],"extend":[155],"more":[158,258],"general":[159,259],"setting":[160],"where":[161],"profit":[163,237],"function":[164],"associated":[165],"\u201cspecial\u201d":[173],"submodular":[174],"function.":[175,238],"This":[176,192],"generalization":[177],"captures":[178],"problem":[183,252],"capacities":[185],"and/or":[186],"weighted":[187,247],"profits":[188],"special":[190],"cases.":[191],"implies":[193],"q)$":[196],"(where":[198],"$q$":[199],"denotes":[200],"quota)":[202],"$O(1)$":[204],"algorithms":[206,218],"these":[214],"problems.":[215],"While":[216],"simple,":[220],"make":[223],"surprising":[225],"use":[226],"greedy":[229],"cover":[231],"framework":[232],"in":[233],"defining":[234],"useful":[236],"prove":[241],"(both":[243],"edge":[244],"node)":[246],"PCDS":[251],"hard":[255],"group":[260],"Steiner":[261],"tree":[262]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}