On sums of independent random variables with unbounded variance, and estimating the average degree in a graph

DOI10.1145/1007352.1007443zbMath1192.60021OpenAlexW2121707217MaRDI QIDQ3580951

No author found.

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007443

Mathematics Subject Classification ID

Combinatorial probability (60C05) Approximation algorithms (68W25) Vertex degrees (05C07)

Related Items (4)

Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms ⋮ A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling ⋮ A sublinear-time approximation scheme for bin packing ⋮ Edge-statistics on large graphs

This page was built for publication: On sums of independent random variables with unbounded variance, and estimating the average degree in a graph