scientific article; zbMATH DE number 2079416

zbMATH Open1092.68622MaRDI QIDQ4471376FDOQ4471376

Authors: Funda Ergün, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler, Artur Czumaj, Lance Fortnow 

Publication date: 28 July 2004

Title of this publication is not available (Why is that?)

Recommendations

• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
• A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
• Estimating the weight of metric minimum spanning trees in sublinear-time
• Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
• Approximate geometric MST range queries

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (9)

• Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
• Lower bounds for testing Euclidean minimum spanning trees
• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
• A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
• Time-space trade-offs for computing Euclidean minimum spanning trees
• The saga of minimum spanning trees
• Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels
• Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
• Approximate geometric MST range queries

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471376)