2025
A Generalized Binary Tree Mechanism for Private Approximation of All-Pair Shortest Distances
The problem of approximating all-pair distances in a weighted undirected graph with differential privacy is studied, and efficient algorithms with significantly improved bounds are obtained on a broad class of graphs which are referred to as recursively separable.
Zongrui Zou, Chenglin Fan, Michael Dinitz et al.
· Advances in Neural Informati... · 0 citations