Estimating the weight of metric minimum spanning trees in sublinear-time

DOI10.1145/1007352.1007386zbMATH Open1192.68888OpenAlexW2061598457MaRDI QIDQ3580967FDOQ3580967

Authors: Christian Sohler, Artur Czumaj 

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/2416/1/WRAP_Czumaj_estimating_weight.pdf

Recommendations

• Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
• scientific article; zbMATH DE number 1756011
• scientific article; zbMATH DE number 1670813
• Approximating the Minimum Spanning Tree Weight in Sublinear Time
• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

Mathematics Subject Classification ID

Trees (05C05) Randomized algorithms (68W20) Approximation algorithms (68W25)

Cited In (13)

• Approximating the Minimum Spanning Tree Weight in Sublinear Time
• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
• Separating sublinear time computations by approximate diameter
• Separating Sublinear Time Computations by Approximate Diameter
• Title not available (Why is that?)
• Title not available (Why is that?)
• A sublinear-time approximation scheme for bin packing
• The saga of minimum spanning trees
• Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
• A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
• Estimating the number of connected components in sublinear time
• Streaming Euclidean MST to a constant factor

This page was built for publication: Estimating the weight of metric minimum spanning trees in sublinear-time

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