 
Summary: Network Construction with Subgraph Connectivity
Constraints
Dana Angluina
, James Aspnesa
, Lev Reyzinb
a
Department of Computer Science, Yale University
51 Prospect St., New Haven, CT 06511
{dana.angluin, james.aspnes}@yale.edu
b
School of Computer Science, Georgia Institute of Technology
266 Ferst Drive, Atlanta GA 30332
lreyzin@cc.gatech.edu
Abstract
We consider the problem introduced by Korach and Stern in [15] of building
a network given connectivity constraints. A network designer is given a set
of vertices V and constraints Si V , and seeks to build the lowest cost set of
edges E such that each Si induces a connected subgraph of (V, E). First, we
answer a question posed by Korach and Stern in [16]: for the offline version
of the problem, we prove an (log(n)) hardness of approximation result for
