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

An 11/6-approximation algorithm for the network steiner problem

โœ Scribed by A. Z. Zelikovsky

Publisher
Springer
Year
1993
Tongue
English
Weight
442 KB
Volume
9
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A Polylogarithmic Approximation Algorith
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
โœ 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