𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation algorithm for the wireless gathering problem

✍ Scribed by Vincenzo Bonifaci; Peter Korteweg; Alberto Marchetti-Spaccamela; Leen Stougie

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
629 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved approximation algorithm for
An improved approximation algorithm for the partial Latin square extension problem
✍ Carla P. Gomes; Rommel G. Regis; David B. Shmoys πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 203 KB

The problem of completing partial latin squares arises in a number of applications, including conflict-free wavelength routing in wide-area optical networks, statistical designs, and error-correcting codes. A partial latin square is an n by n array such that each cell is either empty or contains exa

Approximation algorithm for the group St
Approximation algorithm for the group Steiner network problem
✍ Michal Penn; Stas Rozenfeld πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 143 KB

## Abstract In this article we study the __group Steiner network__ problem, which is defined in the following way. Given a graph __G__ = (__V,E__), a partition of its vertices into K groups and connectivity requirements between the different groups, the aim is to find simultaneously a set of repres