The iterative rounding framework of Byrka, Guo, Hu, Li, Wan, and Wang is refined, which gives a $(2+\varepsilon)-approximation for $k$-median, and the Euclidean $k$-median bound relies on a geometric inequality proved via a nonnegativity certificate constructed from positive-semidefinite kernels.
Jarosław Byrka, Yu-Hao Guo, Yang Hu et al.· 0 citations
This work studies how precise central differential privacy and local differential privacy can be for common voting rules, including Plurality, Condorcet, Maximin, Plurality with Runoff, and Single Transferable Vote, and proves upper bounds on the required margin for these algorithms.
Quentin Hillebrand, Pasin Manurangsi, Vorapong Suppakitpaisarn et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.