A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Near Optimal Bounds for Steiner Trees in the Hypercube

2011
*
SIAM journal on computing (Print)
*

Given a set S of vertices in a connected graph G, the classic Steiner tree problem asks for the minimum number of edges of a connected subgraph of G that contains S. We study this problem in the hypercube. Given a set S of vertices in the n-dimensional hypercube Q n , the Steiner cost of S, denoted by cost(S), is the minimum number of edges among all connected subgraphs of Q n that contain S. We obtain the following results on cost(S). Let be any given small, positive constant, and set k = |S|.

doi:10.1137/100797473
fatcat:2nzaa2w4vnfqrijtgox46xgk3e