Pages that link to "Item:Q5194735"
From MaRDI portal
The following pages link to Approximating Fault-Tolerant Domination in General Graphs (Q5194735):
Displaying 9 items.
- Bounds on the 2-domination number (Q1744236) (← links)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- False alarms in fault-tolerant dominating sets in graphs (Q4908866) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- Fault-tolerant total domination via submodular function approximation (Q6111966) (← links)