scientific article; zbMATH DE number 1756011
From MaRDI portal
Publication:4535797
zbMATH Open0987.68527MaRDI QIDQ4535797FDOQ4535797
Authors: Ronitt Rubinfeld, Luca Trevisan, Bernard Chazelle 
Publication date: 25 June 2002
Title of this publication is not available (Why is that?)
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Cited In (18)
- Approximating minimum-cost graph problems with spanning tree edges
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
- Estimating the weight of metric minimum spanning trees in sublinear-time
- Estimating graph parameters from random order streams
- Contemplations on Testing Graph Properties
- Tolerant property testing and distance approximation
- A sublinear-time approximation scheme for bin packing
- Minimum-weight spanning tree algorithms. A survey and empirical study
- Introduction to testing graph properties
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- Introduction to testing graph properties
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
- Estimating the number of connected components in sublinear time
- Title not available (Why is that?)
- (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
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 Q4535797)
