Publication:2934611
From MaRDI portal
zbMath1302.68314MaRDI QIDQ2934611
Andrew McGregor, Graham Cormode, Amit Chakrabarti
Publication date: 18 December 2014
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
05C81: Random walks on graphs
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