Papers
Topics
Authors
Recent
Search
2000 character limit reached

Estimating Graph Parameters from Random Order Streams

Published 13 Nov 2017 in cs.DS | (1711.04881v1)

Abstract: We develop a new algorithmic technique that allows to transfer some constant time approximation algorithms for general graphs into random order streaming algorithms. We illustrate our technique by proving that in random order streams with probability at least $2/3$, ∙\bullet the number of connected components of GG can be approximated up to an additive error of εn\varepsilon n using (1ε)O(1/ε3)(\frac{1}{\varepsilon})^{O(1/\varepsilon^3)} space, ∙\bullet the weight of a minimum spanning tree of a connected input graph with integer edges weights from {1,…,W}\{1,\dots,W\} can be approximated within a multiplicative factor of 1+ε1+\varepsilon using (1ε)O~(W3/ε3)\big(\frac{1}{\varepsilon}\big)^{\tilde O(W^3/\varepsilon^3)} space, ∙\bullet the size of a maximum independent set in planar graphs can be approximated within a multiplicative factor of 1+ε1+\varepsilon using space 2(1/ε)(1/ε)log⁡O(1)(1/ε)2^{(1/\varepsilon)^{(1/\varepsilon)^{\log^{O(1)} (1/\varepsilon)}}}.

Authors (2)
Citations (23)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.