Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving Capacitated Dominating Set by using covering by subsets and maximum matching |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Capacitated Dominating Set by using covering by subsets and maximum matching |
scientific article |
Statements
Solving Capacitated Dominating Set by using covering by subsets and maximum matching (English)
0 references
2 April 2014
0 references
exact exponential-time algorithms
0 references
NP-hard problem
0 references
capacitated dominating set
0 references
