Approximation Algorithms and Hardness for Domination with Propagation
From MaRDI portal
Recommendations
- Approximation Algorithms and Hardness for Domination with Propagation
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Approximation algorithms for domination search
- Algorithms – ESA 2004
- Approximation algorithms for connected dominating sets
- Approximation algorithms for connected dominating sets
- Capacitated domination: problem complexity and approximation algorithms
- Approximation hardness of dominating set problems in bounded degree graphs
- On the parameterized complexity of approximating dominating set
- On the Parameterized Complexity of Approximating Dominating Set
Cited in
(25)- On the approximability of the minimum rainbow subgraph problem and other related problems
- Power domination in circular-arc graphs
- On some tractable and hard instances for partial incentives and target set selection
- Disproofs of three conjectures on the power domination of graphs
- Generalized power domination in claw-free regular graphs
- On the harmless set problem parameterized by treewidth
- Parameterized approximability of maximizing the spread of influence in networks
- Generalized power domination: propagation radius and Sierpiński graphs
- The k-power domination problem in weighted trees
- The complexity of finding harmless individuals in social networks
- Connected power domination in graphs
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Hybrid search for the optimal PMU placement problem on a power grid
- Algorithms and complexity of power domination in graphs
- Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
- Generalized power domination of graphs
- Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
- Minimum power dominating sets of random cubic graphs
- Vertex sequences in graphs
- Approximation Algorithms and Hardness for Domination with Propagation
- Power domination with bounded time constraints
- \(k\)-power domination in block graphs
- On Structural Parameterizations of the Harmless Set Problem
- Power domination in regular claw-free graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
This page was built for publication: Approximation Algorithms and Hardness for Domination with Propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901134)
