𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Algorithms for Biclustering Problems

✍ Scribed by Wang, Lusheng; Lin, Yu; Liu, Xiaowen

Book ID
118180761
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
763 KB
Volume
38
Category
Article
ISSN
0097-5397

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.