Approximating average parameters of graphs in memory of Shimon even (1935-2004)

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

Volumn 4110 LNCS, Issue , 2006, Pages 363-374

  Goldreich, Oded ^a   Ron, Dana ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING;

STANDARD NEIGHBOR QUERIES; SUBLINEAR ALGORITHMS; SUBLINEAR RANDOMIZED ALGORITHMS;

GRAPH THEORY;

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

References (17)

1. K. Barhum. MSc. thesis, Weizmann Institute of Science. In preparation.
2. M. Bǎdoiu, A. Czumaj, P. Indyk, and C. Sohler. Facility Location in Sublinear Time. In Proc. of the 32nd ICALP, 2005.
3. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the Minimum Spanning Tree Weight in Sublinear Time. In SIAM Journal on Computing, Vol. 34, pages 1370-1379, 2005.
4. D. Coppersmith and S. Winograd. Matrix Multiplication via Arithmetic Progression. Journal of Symbolic Computation, Vol. 9, pages 251-280, 1990.
5. D. Dor, S. Halperin, and U. Zwick. All Pairs Almost Shortest Paths. SIAM Journal on Computing, Vol. 29, pages 1740-1759, 2000.
6. M. L. Elkin. Computing Almost Shortest Paths. Technical Report MCS01-03, Faculty of Mathematics and Computer Science, Weizmann Institute of Science, 2001.
7. S. Even. Graph Algorithms. Computer Science Press, 1979.
8. U. Feige. On sums of independent random variables with unbounded variance, and estimating the average degree in a graph. In Proc. of the 36th STOC, pages 594-603, 2004.
9. Z. Galil and O. Margalit. All Pairs Shortest Paths for Graphs with Small Integer Length Edges. Information and Computation, Vol. 54, pages = 243-254, 1997.
10. O. Goldreich and D. Ron. Property Testing in Bounded Degree Graphs. Algorithmica, Vol. 32 (2), pages 302-343, 2002.
11. O. Goldreich and D. Ron. A Sublinear Bipartitness Tester for Bounded Degree Graphs. Combinatorica, Vol. 19 (3), pages 335-373, 1999.
12. O. Goldreich and D. Ron. Approximating Average Parameters of Graphs. ECCC, TR05-073.
13. P. Indyk. Sublinear Time Algorithms for Metric Space Problems, in Proc. of the 31st STOC, pages 428-434, 1999.
14. T. Kaufman, M. Krivelevich, and D. Ron. Tight Bounds for Testing Bipartiteness in General Graphs. In SIAM Journal on Computing, Vol. 33, pages 1441-1483, 2004.
15. M. Parnas and D. Ron. Testing the diameter of graphs. Random Structures and Algorithms, Vol. 20 (2), pages 165-183, 2002.
16. R. Siedel. On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. Journal of Computer and System Sciences, Vol. 51, pages 400-403, 1995.
17. U. Zwick. Exact and approximate distances in graphs - a survey. Proceedings of the 9th Annual European Symposium on Algorithms (ESA), pages 33-48, 2001.