527 search results - page 16 / 106 » Implementation of Approximation Algorithms for the Multicast... |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
SIAMCOMP
2008
13 years 8 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
LCN
2006
IEEE
14 years 2 months ago
2006
IEEE
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
ICASSP
2011
IEEE
13 years 4 days ago
2011
IEEE
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
JACM
2007
13 years 8 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...