Approximating the Minimum Spanning Tree Weight in Sublinear Time (2001)

by Bernard Chazelle , Ronitt Rubinfeld , Luca Trevisan
Venue:In Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming (ICALP
Citations:38 - 6 self

Active Bibliography

16 Estimating the weight of metric minimum spanning trees in sublinear-time – Artur Czumaj, Christian Sohler
22 Sublinear time algorithms – Ronitt Rubinfeld - 2003
4 A polynomial time approximation scheme for metric MIN-BISECTION – W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon - 2002
10 Sublinear-time algorithms – Artur Czumaj, Christian Sohler - 2010
6 The art of uninformed decisions – Eldar Fischer
2 Testing Euclidean minimum spanning trees in the plane – Artur Czumaj, Christian Sohler, Martin Ziegler - 2007
8 Soft kinetic data structures – Artur Czumaj, Christian Sohler T
3 Two Linear Time Algorithms for MST on Minor Closed Graph Classes – Martin Mares - 2002
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998
128 The art of uninformed decisions: A primer to property testing – Eldar Fischer - 2001
6 Testing st-connectivity – Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman - 2007
1 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
Finding Minimum Spanning Trees in O(m α(m,n)) Time – Seth Pettie - 1999
1.1 History and Content........................... 6 – Jinna Lei - 2010
5 Sampling sub-problems of heterogeneous Max-Cut problems and approximation algorithms – Petros Drineas, Ravi Kannan
12 Distribution-free property testing – Shirley Halevy - 2003
9 Quantum testers for hidden group properties – Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen - 2008
22 Property Testing: A Learning Theory Perspective – Dana Ron