Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

14 years 10 months ago

Download www.cs.gsu.edu

Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In this generalization, each node possesses a rate and the cost of an edge with length l in a Steiner tree T connecting the source to non-zero rate nodes is l

Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs

Real-time Traffic

ALGORITHMICA 2005 | Multicast Tree Problem | Steiner Tree | Tree Problem |

claim paper

» Improving the Fault Resilience of Overlay Multicast for Media Streaming

» Construction of a ProxyBased Overlay Skeleton Tree for LargeScale RealTime Group Communica...

» Optimal Partition of QoS Requirements for ManytoMany Connections

» Algorithms for delayconstrained lowcost multicast tree construction

» Multiple multicast tree allocation in IP network

» A Variable Neighborhood Descent Search Algorithm for DelayConstrained LeastCost Multicast ...

» Content distribution by multiple multicast trees and intersession cooperation Optimal algo...

» Techniques of reconstructing overlay multicast trees for multimedia streaming

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	ALGORITHMICA
Authors	Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky

Comments (0)

Sciweavers

Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

ALGORITHMICA 2005 | Multicast Tree Problem | Steiner Tree | Tree Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers