4 papers · 1 filter
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…
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…
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos
We consider the \emph{Budgeted} version of the classical \emph{Connected Dominating Set} problem (BCDS). Given a graph and a budget , we seek a connected subset of at most $…
Maximum Rooted Connected Expansion
Ioannis Lamprou, Russell Martin, Sven Schewe +2
Prefetching constitutes a valuable tool toward efficient Web surfing. As a result, estimating the amount of resources that need to be preloaded during a surfer's browsing becomes a…