scientific article; zbMATH DE number 2079416

MaRDI QIDQ4471376zbMATH OpenFDO

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

Publication date 28 July 2004

Mathematics Subject Classification ID

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

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

Cited in

(8)

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

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)