A fast search algorithm for the quorumcast routing problem.

DOI10.1016/S0020-0190(98)00033-7MaRDI QIDQ2583541zbMATH OpenOpenAlexFDO

Authors Chor-Ping Low

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00033-7

zbMATH Keywords

AlgorithmsNP-completenessMulticastExhaustive search algorithmPruning search spaceQuorumcast routing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 1535254
• Solving the quorumcast routing problem as a mixed integer program
• Solving the quorumcast routing problem by constraint programming
• A survey of combinatorial optimization problems in multicast routing
• Concurrent multicast in weighted networks

Cites work

• A note on two problems in connexion with graphs
• How to assign votes in a distributed system
• Steiner problem in networks: A survey

Cited in

(5)

• Solving the quorumcast routing problem as a mixed integer program
• scientific article; zbMATH DE number 1875434 (Why is no real title available?)
• scientific article; zbMATH DE number 1535254 (Why is no real title available?)
• LS(graph): a constraint-based local search for constraint optimization on trees and paths
• Solving the quorumcast routing problem by constraint programming

This page was built for publication: A fast search algorithm for the quorumcast routing problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583541)