Near Optimal Bounds for Steiner Trees in the Hypercube.

Tao Jiang Zevi Miller Dan Pritikin

Published in: SIAM J. Comput. (2011)

Keyphrases

complex networks
steiner tree
lower bound
minimum spanning tree
facility location
shortest path
upper bound
linear programming relaxation
constraint satisfaction
lower and upper bounds
dynamic programming
worst case
branch and bound