Publication:2934611
From MaRDI portal
zbMath1302.68314MaRDI QIDQ2934611
Andrew McGregor, Graham Cormode, Amit Chakrabarti
Publication date: 18 December 2014
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Random walks on graphs (05C81)
Related Items
Optimal sampling from sliding windows, Exponential time improvement for min-wise based algorithms, Sketching information divergences, Hierarchical sampling from sketches: Estimating functions over data streams, Arthur-Merlin streaming complexity