This work considers the class of open addressing hash tables that uses a fixed offset sequence that uses a fixed offset sequence $r_0,r_1,\ldots,r_{n-1}$ to find an open slot in the table and gives a simple analysis that the expected insertion time when the load factor is 1-\epsilon is O(\epsilon^{-2})$.
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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.