We present in this paper heuristics for the multicast routing problem in communications. Two constraints are considered, namely, the end-to-end delay along the path from the source to any destination is bounded, and the total cost of the edges associated with the problem-defining graph is minimized. It is shown by computer simulation that our proposed heuristics perform significantly better than that of a previous method [8].