Concurrent multicast in weighted networks
From MaRDI portal
Publication:5054855
DOI10.1007/BFb0054367zbMath1502.68042OpenAlexW1521371631MaRDI QIDQ5054855
Ugo Vaccaro, Luisa Gargano, Gianluca De Marco
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0054367
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
- 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
- An 11/6-approximation algorithm for the network Steiner problem
- The Communication Complexity of Atomic Commitment and of Gossiping
- Generalizations of broadcasting and gossiping
- Steiner problem in networks: A survey
- A survey of gossiping and broadcasting in communication networks
- Dynamic Steiner Tree Problem
- Parallel Information Dissemination by Packets
- Fast gossiping by short messages
- A very short proof of a conjecture concerning set‐to‐set broadcasting
This page was built for publication: Concurrent multicast in weighted networks
