Pages that link to "Item:Q1944213"
From MaRDI portal
The following pages link to Capacitated domination faster than \(O(2^n)\) (Q1944213):
Displaying 8 items.
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← 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)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Exact capacitated domination: on the computational complexity of uniqueness (Q2696625) (← links)
- Public goods in networks with constraints on sharing (Q6564056) (← links)