5 citations · 5 across the 2 of their papers we have counts for
2 papers
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 ($…
cs.CC2007★ 5 cited
Approximation algorithms and hardness for domination with propagation
Ashkan Aazami, Michael D. Stilp
The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes that power dominates all the nodes…