An almost four-approximation algorithm for maximum weight triangulation

By Hu Shiyan  

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 31-42

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

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

By Zhao L.   Nagamochi H.   Ibaraki T.  

Journal of Combinatorial Optimization, Vol. 5, Iss. 4, 2001-12 ,pp. : 397-410

Springer Publishing Company

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