Sciweavers

393 search results - page 8 / 79
» Approximation Algorithm for Directed Telephone Multicast Pro...
Sort
View
INFOCOM
1999
IEEE
13 years 11 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
JSAC
2006
79views more  JSAC 2006»
13 years 6 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
14 years 1 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
MOBIHOC
2004
ACM
14 years 4 days ago
Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional ant
Energy conservation is a critical issue in wireless ad hoc networks since batteries are the only energy source to power the nodes. One major metric for energy conservation is to r...
Song Guo, Oliver W. W. Yang
ICALP
2007
Springer
14 years 26 days ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber