Sciweavers

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

88

SODA
2003
ACM

94views Algorithms» more SODA 2003»

Sublinear-time approximation of Euclidean minimum spanning tree

15 years 3 months ago

Sublinear-time approximation of Euclidean minimum spanning tree

Download www.cs.princeton.edu

Artur Czumaj, Funda Ergün, Lance Fortnow, Avn

Real-time Traffic

Algorithms | SODA 2003 |

claim paper

Related Content

» Approximating the Minimum Spanning Tree Weight in Sublinear Time

» Approximating khop Minimum Spanning Trees in Euclidean Metrics

» Estimating the weight of metric minimum spanning trees in sublineartime

» Euclidean boundeddegree spanning tree ratios

» The MinimumArea Spanning Tree Problem

» Greedy Heuristics and an Evolutionary Algorithm for the BoundedDiameter Minimum Spanning T...

» Analysis of two Sweepline Algorithms for Constructing Spanning Trees and Steiner Trees

» Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by ClusteringBased Me...

» Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on ...

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler

Comments (0)