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:44 - 6 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
428 Property Testing and its connection to Learning and Approximation – Oded Goldreich, Shafi Goldwasser, Dana Ron
119 Property Testing in Bounded Degree Graphs – Oded Goldreich, Dana Ron - 1997
332 Robust Characterizations of Polynomials with Applications to Program Testing – Ronitt Rubinfeld, Madhu Sudan - 1996
18 Estimating the weight of metric minimum spanning trees in sublinear-time – Artur Czumaj, Christian Sohler
726 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
912 Approximation Algorithms – V Vazirani - 2004
347 Self-Testing/Correcting with Applications to Numerical Problems – Manuel Blum, Michael Luby, Ronitt Rubinfeld - 1990
1509 PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES – Wassily Hoeffding - 1962