2 papers
cs.DS2019
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 $…
cs.DS2018
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…