Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.66, Iss.1, 2007-08, pp. : 117-125

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

Abstract

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

Britvic 'concentrates' on speeding up their pumping process

World Pumps, Vol. 2002, Iss. 424, 2002-01 ,pp. : 14-14

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

Increasing the Weight of Minimum Spanning Trees

By Frederickson G.N. Solis-Oba R.

Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. : 244-266

Academic Press

Access to resources Recommend Favorite

Counting Minimum Weight Spanning Trees

By Broder A.Z. Mayr E.W.

Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. : 171-176

Academic Press

Access to resources Recommend Favorite