The quorumcast routing problem is a generalization of multicasting
which arises in many distributed applications. It consists of
finding a minimum cost tree that spans the source node r and any
q out of m specified nodes on a given undirected weighted
graph. This paper proposes a complete and an incomplete approach,
both based on the same Constraint Programming (CP) model, but with two
different specific search heuristics based on shortest
paths. Experimental results show the efficiency of the two proposed