On the Value of a Random Minimum Weight Steiner Tree

  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},
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
Highly Cited
This paper has 20 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 14 extracted citations

Size and Weight of Shortest Path Trees with Exponential Link Weights

Combinatorics, Probability & Computing • 2006
View 4 Excerpts
Highly Influenced

Protecting Location Privacy in Sensor Networks against a Global Eavesdropper

IEEE Transactions on Mobile Computing • 2012
View 3 Excerpts
Highly Influenced

A framework of location privacy and minimum average communication under the global eaves dropper

2013 International Conference on Current Trends in Engineering and Technology (ICCTET) • 2013
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 26 references

On the value of a random minimum spanning tree problem

Discrete Applied Mathematics • 1985
View 16 Excerpts
Highly Influenced

Random Graphs, 2 ed

B. Bollobás
View 1 Excerpt

The zeta(2) limit in the random assignment problem

Random Struct. Algorithms • 2001
View 1 Excerpt

Trevisan : Improved nonapproximability results for minimum vertex cover with density constraints , Theoret

Random Graphs • 2001

Kesten : Inequalities with applications to percolation and reliability

J. van den Berg, H.
Proc . 11 th ACMSIAM Symposium on Discrete Algorithms • 2000

Proof Of The Van Den Berg-Kesten Conjecture

Combinatorics, Probability & Computing • 2000
View 1 Excerpt

Zelikovsky : Improved Steiner tree approximation in graphs

Combinatorics Probability and Computing • 2000

Prieditis : The expected length of a shortest path

Comput . Sci . • 1999

Similar Papers

Loading similar papers…