On total f-domination: Polyhedral and algorithmic results

Given a graph G=(V,E) and integer values f _v , v∈V, a node subset D⊂V is a total f-dominating set if every node v∈V is adjacent to at least f _v nodes of D. Given a weight system c(v), v∈V, the minimum weight total f-dominating set problem is to find a total f-dominating set of minimum total weight. In this article, we propose a polyhedral study of the associated polytope together with a complete and compact description of the polytope for totally unimodular graphs and cycles. We also propose a linear time dynamic programming algorithm for the case of trees.