On the Value of a Random Minimum Weight Steiner Tree

Author： Bollobás* Béla   Gamarnik David   Riordan Oliver   Sudakov† Benny  

Publisher： Springer Publishing Company

ISSN： 0209-9683

Source： Combinatorica, Vol.24, Iss.2, 2004-04, pp. : 187-207

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Two Variations of the Minimum Steiner Problem

By Hsu Tsan-Sheng   Tsai Kuo-Hui   Wang Da-Wei   Lee D.  

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 101-120

Springer Publishing Company

Access to resources Recommend Favorite

An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*

By Lau† Lap  

Combinatorica, Vol. 27, Iss. 1, 2007-02 ,pp. : 71-90

Springer Publishing Company

Access to resources Recommend Favorite

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

By Bahiense Laura   Barahona Francisco   Porto Oscar  

Journal of Combinatorial Optimization, Vol. 7, Iss. 3, 2003-09 ,pp. : 259-282

Springer Publishing Company

Access to resources Recommend Favorite

Differential approximation results for the Steiner tree problem

By Demange M.   Monnot J.   Paschos V.T.  

Applied Mathematics Letters, Vol. 16, Iss. 5, 2003-07 ,pp. : 733-739

Elsevier

Access to resources Recommend Favorite

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

By Garg N.   Konjevod G.   Ravi R.  

Journal of Algorithms, Vol. 37, Iss. 1, 2000-10 ,pp. : 66-84

Academic Press

Access to resources Recommend Favorite