Sciweavers

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

11

IPPS
2003
IEEE

favoriteEmaildiscussreport

115views Distributed And Parallel Com...» more IPPS 2003»

The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs

13 years 9 months ago

The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs

Download www.ibisc.univ-evry.fr

Lélia Blin, Franck Butelle

Real-time Traffic

Distributed And Parallel Computing | IPPS 2003 |

claim paper

Related Content

» Approximating minimum bounded degree spanning trees to within one of optimal

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

» Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem

» The Directed MinimumDegree Spanning Tree Problem

» Spanning trees with minimum weighted degrees

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

» Approximating Spanning Trees with Inner Nodes Cost

» A 53Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs

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

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	IPPS
Authors	Lélia Blin, Franck Butelle

Comments (0)