Pages that link to "Item:Q2345937"
From MaRDI portal
The following pages link to Capacitated domination: problem complexity and approximation algorithms (Q2345937):
Displaying 7 items.
- \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities (Q1741845) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games (Q2019479) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q2420573) (← links)
- Exact capacitated domination: on the computational complexity of uniqueness (Q2696625) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
