most citedApproximation algorithms and hardness for domination with propagation

5 citations · 5 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2008

Domination in graphs with bounded propagation: algorithms, formulations and hardness results

Ashkan Aazami

We introduce a hierarchy of problems between the \textsc{Dominating Set} problem and the \textsc{Power Dominating Set} (PDS) problem called the -round power dominating set ($…