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

Steiner problem in Halin networks

โœ Scribed by Pawel Winter


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
630 KB
Volume
17
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Approximation algorithm for the group St
โœ 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