Sciweavers

103 search results - page 4 / 21
» Approximating rooted Steiner networks
Sort
View
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
13 years 10 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
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 ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
NETWORKS
1998
13 years 10 months ago
Approximating Steiner trees in graphs with restricted weights
Magnús M. Halldórsson, Shuichi Ueno,...
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
14 years 4 months ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
CDC
2009
IEEE
183views Control Systems» more  CDC 2009»
14 years 1 months ago
Algorithms and stability analysis for content distribution over multiple multicast trees
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
Xiaoying Zheng, Chunglae Cho, Ye Xia
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 10 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy