Approximating the minimum spanning tree weight in sublinear time
From MaRDI portal
Recommendations
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Estimating the weight of metric minimum spanning trees in sublinear-time
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
- A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
- A fast distributed approximation algorithm for minimum spanning trees
Cited in
(18)- A sublinear-time approximation scheme for bin packing
- Approximating minimum-cost graph problems with spanning tree edges
- Estimating the number of connected components in sublinear time
- Tolerant property testing and distance approximation
- Introduction to testing graph properties
- Contemplations on Testing Graph Properties
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
- Estimating the weight of metric minimum spanning trees in sublinear-time
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
- scientific article; zbMATH DE number 3974972 (Why is no real title available?)
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- Estimating graph parameters from random order streams
- Introduction to testing graph properties
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- Minimum-weight spanning tree algorithms. A survey and empirical study
- (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond
This page was built for publication: Approximating the minimum spanning tree weight in sublinear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535797)
