ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
From MaRDI portal
Publication:5249291
DOI10.1142/S0129054101000874zbMath1319.68018WikidataQ128924609 ScholiaQ128924609MaRDI QIDQ5249291
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
approximation algorithmsrandomized algorithmsmultimessage multicastingforwardingfully connected networks
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Approximation algorithms (68W25) Randomized algorithms (68W20)
Cites Work
- Data transfers in networks
- Complexity and approximations for multimessage multicasting
- The Complexity of File Transfer Scheduling with Forwarding
- Scheduling File Transfers
- Link scheduling in polynomial time
- Scheduling file transfers in fully connected networks
- Open Shop Scheduling to Minimize Finish Time
- A practical version of Lee's multicast switch architecture
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
- Data transfers in networks with transceivers
- Simple algorithms for multimessage multicasting with forwarding
This page was built for publication: ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
