Sciweavers

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

11

IPL
2007

favoriteEmaildiscussreport

81views more IPL 2007»

Lower bounds for testing Euclidean Minimum Spanning Trees

13 years 4 months ago

Lower bounds for testing Euclidean Minimum Spanning Trees

Download cs.haifa.ac.il

Oren Ben-Zwi, Oded Lachish, Ilan Newman

Real-time Traffic

IPL 2007 |

claim paper

Related Content

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

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

» Testing Euclidean minimum spanning trees in the plane

» Combinatorial changes of euclidean minimum spanning tree of moving points in the plane

» ShallowLowLight Trees and Tight Lower Bounds for Euclidean Spanners

» A NearTight Lower Bound on the Time Complexity of Distributed MinimumWeight Spanning Tree ...

» An InverseAckermann Style Lower Bound for the Online Minimum Spanning Tree

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

» Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	IPL
Authors	Oren Ben-Zwi, Oded Lachish, Ilan Newman

Comments (0)