Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching

DOI10.1007/978-3-642-16926-7_10zbMath1310.05162MaRDI QIDQ3057615

Yngve Villanger, Mathieu Liedloff, Ioan Todinca

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_10

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

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