… a multispace search algorithm to solve the quorumcast routing … an overview of some existing
quorumcast routing methods. In … in the objective function space for quorumcast routing. A …

… In [8], a multispace search heuristic was proposed for solving the particular QR problem
where S = V. It gives better results than the IMP and the MAD heuristics on 12-node networks …

… In [8], a multispace search heuristic was proposed for solving the particular QR problem
where S = V . It gives better results than the IMP and the MAD heuristics on 12-node networks …

… [5] gave a multispace search algorithm to minimize the manycast routing cost of the network,
… A fast search algorithm for the quorumcast routing problem,Information processing letters, …

… quorumcast routing problem (QRP) is to find a minimum cost tree T that spans r and at least
q nodes of S [5,24,12,32,29]. QRP is NP-hard, as it reduces to the Steiner tree problem [14] …

… based on rooted span- ning trees to find high-quality solutions to COP problems. This … ,
eg, the quorumcast routing problem, the edge-disjoint paths problem, and the routing and …

… quorumcast routing problem (QRP) is to find a minimum cost tree T that spans r and at least
q nodes of S [5,24,12,32,29]. QRP is NP-hard, as it reduces to the Steiner tree problem [14] …

… routing problem are unlikely to be found. Cheung etc [2] first studied manycast (quorumcast)
problem which consists of finding a … Du etc [3] proposed a multispace search algorithm by …

… In [29], a multispace search heuristic has been proposed for solving this problem … quorumcast
routing problem and two COP problems: the edge-disjoint paths problem and the routing …

… On the other hand, for the quorumcast routing and the edge-disjoint paths problems, we
show competitive … This multispace search algorithm consider the QR problem where S ≡ V . …