Distance approximation in bounded-degree and general sparse graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4110 LNCS, Issue , 2006, Pages 475-486

  Marko, Sharon ^a   Ron, Dana ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EDGE DETECTION; GRAPH THEORY; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING;

EDGE MODIFICATIONS; QUERY COMPLEXITY; SPARSE GRAPHS; SUBLINEAR ALGORITHMS;

APPROXIMATION THEORY;

EID: 33750045160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_43     Document Type: Conference Paper

References (18)

1. N. Ailon, B. Chazelle, S. Comandur, and D. Liue. Estimating the distance to a monotone function. In Proceedings of the 8th RANDOM, pages 229-236, 2004. To appear in Random Structures and Algorithms.
2. N. Alon, T. Kaufman, M. Krivilevich, and D. Ron. Testing triangle-freeness in general graphs. In Proceedings of the 17th SODA, pages 279-288, 2006.
3. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. SICOMP, 34(6):1370-1379, 2005.
4. U. Feige. On sums of independent random variables with unbounded variance and estimating the average degree in a graph. In Proceedings of the 36th STOC, pages 594-603, 2004.
5. E. Fischer and L. Fortnow. Tolerant versus intolerant testing for boolean properties. In Proceedings of the 20th IEEE Conference on Computational Complexity, pages 135-140, 2005.
6. E. Fischer and I. Newman. Testing versus estimation of graph properties. In Proceedings of the 37th STOC, pages 138-146, 2005.
7. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653-750, 1998.
8. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, 32(2):302-343, 2002.
9. O. Goldreich and D. Ron. Approximating average parameters of graphs. In these proceedings., 2006.
10. V. Guruswami and A. Rudra. Tolerant locally testable codes. In Proceedings of the 9th RANDOM, pages 306-317, 2005.
11. D. Karger. Global min-cuts in RNC and other ramifications of a simple mincut algorithm. In Proceedings of the 4th SODA, pages 21-30, 1993.
12. T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. SICOMP, 33(6):1441-1483, 2004.
13. M. Luby. A simple parallel algorithm for the maximal independent set problem. SICOMP, 15(2):1036-1055, 1986.
14. S. Marko and D. Ron. Distance approximation in bounded-degree and general sparse graphs. Manuscript. Available from: www.eng.tau.ac.il/~danar., 2006.
15. D. Naor, D. Gusfield, and C. Martel. A fast algorithm for optimally increasing the edge connectivity. SICOMP, 26(4):1139-1165, 1997.
16. M. Parnas and D. Ron. Testing the diameter of graphs. Random Structures and Algorithms, 20(2):165-183, 2002.
17. M. Parnas and D. Ron. On approximating the minimum vertex cover in sublinear time and the connection to distributed algorithms. ECCC Report TR05-094., 2005.
18. M. Parnas, D. Ron, and R. Rubinfeld. Tolerant property testing and distance approximation. ECCC Report TR04-010, 2004, to appear in JCSS.