论文标题
一种简单的差异私人算法，用于全球最低削减
A Simple Differentially Private Algorithm for Global Minimum Cut
论文作者
论文摘要
在本说明中，我们为全局最小切割问题提供了一种简单的差异私有算法，仅使用一个呼叫指数机制。这个问题首先由Gupta等人研究。 [2010]，他们提供了一种私人算法，并提供了近乎最佳的效用保证。我们在许多方面都改善了他们的工作：我们的算法比Gupta等人的算法更简单，更自然，更有效。 [2010]，此外，还提供了更好的隐私和效用保证。
In this note, we present a simple differentially private algorithm for the global minimum cut problem using only one call to the exponential mechanism. This problem was first studied by Gupta et al. [2010], and they gave a differentially private algorithm with near-optimal utility guarantees. We improve upon their work in many aspects: our algorithm is simpler, more natural, and more efficient than the one given in Gupta et al. [2010], and furthermore provides slightly better privacy and utility guarantees.
