We consider four different types of multiple domination and provide new improved upper bounds for the kand k-tuple domination numbers. They generalise two classical bounds for the domination number and are better than a number of known upper bounds for these two multiple domination parameters. Also, we explicitly present and systematize randomized algorithms for finding multiple dominating sets...
