2 papers
cs.DS2024
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Rasmus Pagh, Lukas Retschmeier, Hao Wu +1
We study the problem of privately releasing an approximate minimum spanning tree (MST). Given a graph where is a set of vertices, is a set of …
cs.CR2024
Faster Differentially Private Top- Selection: A Joint Exponential Mechanism with Pruning
Hao WU, Hanwen Zhang
We study the differentially private top- selection problem, aiming to identify a sequence of items with approximately the highest scores from items. Recent work by Gille…