Limited Packing and Multiple Domination problems: Polynomial time reductions

The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between them. Besides, we take into consideration generalized versions of these problems and obtain polynomial time reductions between each one and its generalized version.