Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aamand, Anders, Chen, Justin Y., Dalirrooyfard, Mina, Mitrović, Slobodan, Nevmyvaka, Yuriy, Silwal, Sandeep, Xu, Yinzhan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2507.01873