Approximating Average Parameters of Graphs

DOI10.1007/11830924_34zbMath1155.68571OpenAlexW1593323337MaRDI QIDQ3595407

Oded Goldreich, Dana Ron

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/553/

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (4)

Separating sublinear time computations by approximate diameter ⋮ Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms ⋮ A sublinear-time approximation scheme for bin packing ⋮ Separating Sublinear Time Computations by Approximate Diameter

This page was built for publication: Approximating Average Parameters of Graphs