{"id":"https://openalex.org/W7167904595","doi":"https://doi.org/10.48550/arxiv.2607.07842","title":"Domination and Coverage Problems under Vulnerability Constraints","display_name":"Domination and Coverage Problems under Vulnerability Constraints","publication_year":2026,"publication_date":"2026-07-08","ids":{"openalex":"https://openalex.org/W7167904595","doi":"https://doi.org/10.48550/arxiv.2607.07842"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.07842","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07842","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.07842","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140385386","display_name":"Ioannis Sigalas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sigalas, Ioannis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140446449","display_name":"Nikolaos Lazaropoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lazaropoulos, Nikolaos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049285909","display_name":"Ioannis Lamprou","orcid":"https://orcid.org/0000-0001-5337-7336"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lamprou, Ioannis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031758808","display_name":"Ioannis Vaxevanakis","orcid":"https://orcid.org/0000-0001-7345-8520"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vaxevanakis, Ioannis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110257688","display_name":"Vassilis Zissimopoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zissimopoulos, Vassilis","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9126999974250793,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9126999974250793,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.048700001090765,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.005200000014156103,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7451000213623047},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6010000109672546},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5753999948501587},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5343000292778015},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4830999970436096},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.478300005197525},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4401000142097473},{"id":"https://openalex.org/keywords/vulnerability","display_name":"Vulnerability (computing)","score":0.40560001134872437}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7451000213623047},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6010000109672546},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5753999948501587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5636000037193298},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5343000292778015},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5128999948501587},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4830999970436096},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4401000142097473},{"id":"https://openalex.org/C95713431","wikidata":"https://www.wikidata.org/wiki/Q631425","display_name":"Vulnerability (computing)","level":2,"score":0.40560001134872437},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.38609999418258667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.362199991941452},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.34310001134872437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31049999594688416},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.28940001130104065},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.26409998536109924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26030001044273376},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.07842","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07842","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.07842","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07842","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.44561755657196045}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"various":[1],"domination":[2],"and":[3,14,106,127],"coverage":[4],"problems,":[5],"certain":[6],"vertices":[7,126],"or":[8],"edges":[9],"should":[10],"not":[11],"be":[12,146],"dominated/covered":[13],"are":[15],"designated":[16],"as":[17,149],"vulnerable.":[18],"Motivated":[19],"by":[20],"this,":[21],"we":[22,134],"define":[23],"the":[24,38,62,83,90,101,114,117,121,130,136,154,166,170],"$k$-Vertex":[25],"Maximum":[26,63],"Domination":[27,64],"Ratio":[28,65],"with":[29,66,93,139],"Vulnerable":[30,67,94,140],"Vertices":[31,68,95],"$(k\\textit{-}Max":[32],"\\":[33,59,85],"\\mathit{DRVV})$":[34],"problem,":[35,97,105,143,168],"which":[36,144],"extends":[37],"budgeted":[39],"dominating":[40],"set":[41],"problem":[42],"to":[43,100],"include":[44],"vulnerability":[45],"constraints.":[46],"We":[47,88,159],"propose":[48],"an":[49,54,80],"approximation":[50],"algorithm":[51,78,164],"based":[52],"on":[53],"unbudgeted":[55],"variant":[56],"of":[57,74,116,153],"$k\\textit{-}Max":[58,84],"\\mathit{DRVV}$,":[60],"termed":[61],"$(\\mathit{DRVV})$":[69],"problem.":[70,87,158],"For":[71],"bounded-degree":[72],"graphs":[73],"order":[75,115],"$n$,":[76],"our":[77],"provides":[79],"$O(k/n)$-approximation":[81],"for":[82,165],"\\mathit{DRVV}$":[86],"introduce":[89],"Dominating":[91],"Set":[92,103,156],"$(\\mathit{DSV})$":[96],"reduce":[98],"it":[99],"Red-Blue":[102,155],"Cover":[104,138,157],"derive":[107],"a":[108,150,161],"$2\\sqrt{|V|\\cdot(H(\u0394_{N})-\\frac{1}{2}})$-approximation":[109],"algorithm,":[110],"where":[111],"$|V|$":[112],"is":[113,120,129],"graph,":[118],"$\u0394_N$":[119],"maximum":[122],"degree":[123],"among":[124],"non-vulnerable":[125],"$H$":[128],"harmonic":[131],"function.":[132],"Finally,":[133],"examine":[135],"Vertex":[137],"Edges":[141],"$(\\mathit{VCVE})$":[142],"can":[145],"naturally":[147],"expressed":[148],"special":[151],"case":[152],"present":[160],"polynomial-time":[162],"$2$-approximation":[163],"$VCVE$":[167],"achieving":[169],"best":[171],"possible":[172],"ratio.":[173]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-11T00:00:00"}