2 papers
cs.DS2026
Domination and Coverage Problems under Vulnerability Constraints
Ioannis Sigalas, Nikolaos Lazaropoulos, Ioannis Lamprou +2
In various domination and coverage problems, certain vertices or edges should not be dominated/covered and are designated as vulnerable. Motivated by this, we define the -Vertex…
cs.DS2026
Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis +1
In , given a graph , we seek a minimum-size set of nodes , such that every node in has at least one neighbor in . We define…