Sciweavers

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

62

Voted

STOC
2000
ACM

favoriteEmaildiscussreport

77views Algorithms» more STOC 2000»

A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

15 years 3 months ago

A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

Download www.math.uwaterloo.ca

Jochen Könemann, R. Ravi

Real-time Traffic

Algorithms | STOC 2000 |

claim paper

Related Content

» Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

» Degree Bounded Network Design with Metric Costs

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

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

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

» Spanning trees with minimum weighted degrees

» The Directed MinimumDegree Spanning Tree Problem

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

Post Info
More Details (n/a)

Added	01 Aug 2010
Updated	01 Aug 2010
Type	Conference
Year	2000
Where	STOC
Authors	Jochen Könemann, R. Ravi

Comments (0)