Near Optimal Bounds for Steiner Trees in the Hypercube

Abstract

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 Qn, the Steiner cost of S, denoted by cost(S), is the minimum number of edges among all… (More)
DOI: 10.1137/100797473

Topics

1 Figure or Table

Slides referencing similar topics