Sciweavers

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

10

DC
2008

favoriteEmaildiscussreport

97views Internet Technology» more DC 2008»

A fast distributed approximation algorithm for minimum spanning trees

13 years 4 months ago

A fast distributed approximation algorithm for minimum spanning trees

Download staff.vbi.vt.edu

Maleq Khan, Gopal Pandurangan

Real-time Traffic

DC 2001 | DC 2008 |

claim paper

Related Content

» A distributed approximation algorithm for the minimum degree minimum weight spanning trees

» The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem ...

» A Very Fast Linear Time Distributed Algorithm on General Graphs for the MinimumWeight Span...

» Computing a DiameterConstrained Minimum Spanning Tree in Parallel

» Approximating discrete probability distributions with causal dependence trees

» Fast sharedmemory algorithms for computing the minimum spanning forest of sparse graphs

» Approximating Spanning Trees with Inner Nodes Cost

» Approximating Minimum MaxStretch spanning Trees on unweighted graphs

» Approximating khop Minimum Spanning Trees in Euclidean Metrics

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DC
Authors	Maleq Khan, Gopal Pandurangan

Comments (0)