Pages that link to "Item:Q5901420"
From MaRDI portal
The following pages link to Approximation Algorithms and Hardness for Domination with Propagation (Q5901420):
Displaying 9 items.
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Observing the State of a Smart Grid Using Bilevel Programming (Q3467857) (← links)
- Vertex sequences in graphs (Q5862692) (← links)
