Concurrent multicast in weighted networks

DOI10.1016/S0304-3975(00)00018-9zbMath0973.68006OpenAlexW2071886988MaRDI QIDQ5941285

Gianluca De Marco, Luisa Gargano, Ugo Vaccaro

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00018-9

zbMATH Keywords

concurrent multicast

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner tree problem
• Set to set broadcasting in communication networks
• Optimal sequential gossiping by short messages
• Communication complexity of fault-tolerant information diffusion
• Methods and problems of communication in usual networks
• Communication complexity of gossiping by packets
• New approximation algorithms for the Steiner tree problems
• The Communication Complexity of Atomic Commitment and of Gossiping
• Generalizations of broadcasting and gossiping
• Steiner problem in networks: A survey
• Dynamic Steiner Tree Problem
• Fast Gossiping by Short Messages
• Parallel Information Dissemination by Packets
• A very short proof of a conjecture concerning set‐to‐set broadcasting

This page was built for publication: Concurrent multicast in weighted networks