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

New Reduction Techniques for the Group Steiner Tree Problem

โœ Scribed by Ferreira, Carlos Eduardo; de Oliveira Filho, Fernando M.


Book ID
118204052
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
179 KB
Volume
17
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Polylogarithmic Approximation Algorith
โœ Naveen Garg; Goran Konjevod; R. Ravi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB

The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimum-weight connected subgraph containing at least one vertex from each group.The problem was introduced by Reich a

Probabilistic models for the Steiner Tre
โœ Vangelis Th. Paschos; Orestis A. Telelis; Vassilis Zissimopoulos ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 216 KB