Sciweavers

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

11

JAL
1998

favoriteEmaildiscussreport

41views more JAL 1998»

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

13 years 5 months ago

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Download www.csie.ntu.edu.tw

Hsueh-I Lu, R. Ravi

Real-time Traffic

JAL 1998 |

claim paper

Related Content

» Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights

» An almost fourapproximation algorithm for maximum weight triangulation

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	JAL
Authors	Hsueh-I Lu, R. Ravi

Comments (0)