Pages that link to "Item:Q3057615"
From MaRDI portal
The following pages link to Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615):
Displaying 6 items.
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Maximum Covering Formulation for Open Locating Dominating Sets (Q4596465) (← links)