Scheduling multicasts on unit-capacity trees and meshes.

DOI10.1016/S0022-0000(03)00043-6zbMath1054.68017OpenAlexW2112874128MaRDI QIDQ1401961

Stefano Leonardi, Monika R. Henzinger

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00043-6

zbMATH Keywords

multicast routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Efficient routing in all-optical networks
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Approximate max-flow min-(multi)cut theorems and their applications

This page was built for publication: Scheduling multicasts on unit-capacity trees and meshes.