Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6872240 | Discrete Applied Mathematics | 2014 | 9 Pages |
Abstract
The Capacitated Dominating Set problem is the problem of finding a dominating set of minimum cardinality where each vertex has been assigned a bound on the number of vertices it has capacity to dominate. Cygan et al. showed in 2009 that this problem can be solved in O(n3mnn/3) or in Oâ(1.89n) time using maximum matching algorithm. An alternative way to solve this problem is to use dynamic programming over subsets. By exploiting structural properties of instances that cannot be solved fast by the maximum matching approach, and “hiding” additional cost related to considering subsets of large cardinality in the dynamic programming, an improved algorithm is obtained. We show that the Capacitated Dominating Set problem can be solved in Oâ(1.8463n) time.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mathieu Liedloff, Ioan Todinca, Yngve Villanger,