๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Approximation Algorithm for the Directed Telephone Multicast Problem

โœ Scribed by Michael Elkin; Guy Kortsarz

Publisher
Springer
Year
2006
Tongue
English
Weight
204 KB
Volume
45
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation Algorithms for Directed St
Approximation Algorithms for Directed Steiner Problems
โœ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.

An approximation algorithm for the regis
An approximation algorithm for the register allocation problem
โœ K. Jansen; J. Reiter ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can