Pages that link to "Item:Q2442208"
From MaRDI portal
The following pages link to Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208):
Displaying 5 items.
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- Maximum Covering Formulation for Open Locating Dominating Sets (Q4596465) (← links)