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

Mathieu Liedloff Ioan Todinca Yngve Villanger

Published in: WG (2010)

Keyphrases

dominating set
facility location problem
maximum matching
bipartite graph
facility location
approximation algorithms
connected dominating set
np hard
stable set
network flow problem
search algorithm
integer programming
routing problem