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

ISSN： 0209-9683

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

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

A fuzzy max-flow min-cut theorem

By Diamond P.

Fuzzy Sets and Systems, Vol. 119, Iss. 1, 2001-04 ,pp. : 139-148

Elsevier

Access to resources Recommend Favorite

Holditch Theorem and Steiner Formula for the Planar Hyperbolic Motions

By Yüce Salim Kuruoğlu Nuri

Advances in Applied Clifford Algebras, Vol. 19, Iss. 1, 2009-02 ,pp. : 155-160

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

On the Value of a Random Minimum Weight Steiner Tree

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

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

Springer Publishing Company

Access to resources Recommend Favorite