Solving Capacitated Dominating Set by using covering by subsets and maximum matching

DOI10.1016/j.dam.2012.10.021zbMath1285.05142MaRDI QIDQ2442208

Yngve Villanger, Mathieu Liedloff, Ioan Todinca

Publication date: 2 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

NP-hard problem; exact exponential-time algorithms; capacitated dominating set

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)