Algorithms for Minimum Weighted Dominating Sets in Cycles and Cacti

We study the minimum weighted dominating set problem in graphs. We give polynomial algorithms for cacti, and the first polynomial combinatorial algorithm for cycles. The previously known polynomial algorithm for cycles is based on the ellipsoid method. We also show that by adding extra variables, this can be formulated as a linear program of polynomial size.

Additionally we study the p-dominating set problem, where the cardinality of the set is required to be exactly p. We show that the natural linear programming formulation gives an integral polytope when the graph is a cycle. We also give a polynomial combinatorial algorithm for cacti.

By: Mourad Baïou, Francisco Barahona

Published in: RC25488 in 2014


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .