On the Value of a Random Minimum Weight Steiner Tree

@article{Bollobs2004OnTV,
title={On the Value of a Random Minimum Weight Steiner Tree},
author={B{\'e}la Bollob{\'a}s and David Gamarnik and Oliver Riordan and Benny Sudakov},
journal={Combinatorica},
year={2004},
volume={24},
pages={187-207}
}

Given an arbitrary weighted graph with a fixed set of vertices, the Steiner tree problem is the task of finding a minimum weight subtree containing all these vertices, where the weight of a tree is the sum of the weights of the edges it contains. Steiner trees are very well studied objects in combinatorial optimization; the interest is motivated by several practical problems such as network design and VLSI design. The Steiner tree problem is well known to be NP-complete; this separates it from… CONTINUE READING