Highly Influential

- Published 2007 in Networks
DOI:10.1002/net.20151

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 representatives, one for each group, and a minimum cost connected subgraph that satisfies… CONTINUE READING

### Presentations referencing similar topics