Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

COMBINATORICA
2004

favoriteEmaildiscussreport

53views more COMBINATORICA 2004»

On the Value of a Random Minimum Weight Steiner Tree

13 years 5 months ago

On the Value of a Random Minimum Weight Steiner Tree

Download web.mit.edu

Béla Bollobás, David Gamarnik, Olive

Real-time Traffic

COMBINATORICA 2004 |

claim paper

Related Content

» An Improved LPbased Approximation for Steiner Tree

» A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs

» Algorithms for Terminal Steiner Trees

» Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

» Minimum weight convex Steiner partitions

» Online Priority Steiner Tree Problems

» Quadtree ray shooting and approximate minimum weight Steiner triangulation

» A Faster Better Approximation Algorithm for the Minimum Latency Problem

» Approximating the Weight of Shallow Steiner Trees

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMBINATORICA
Authors	Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov

Comments (0)