A new dual fitting algorithm is given which tightly accounts for dual payments while still facilitating an effective dual feasibility analysis, and a new framework that uses spectral analysis for determining the approximation factor of the algorithm is introduced.
Abstract
We give a new dual fitting algorithm which gives improved approximation ratios of $3+\ln 2 + \epsilon\ (\approx 3.694)$ and $4.9+\epsilon$ for $k$-Means in (high-dimensional) Euclidean and general metrics respectively, improving upon the previously known ratios of $4+\epsilon$ [Charikar, Cohen-Addad, Gao, Grandoni, Lee, and van Wijland STOC'26] and $5+\epsilon$ [Byrka, Guo, Hu, Li, Wan, Wang FOCS'26], resp. In particular, our result for Euclidean $k$-Means breaks the hardness barrier of $1+8/e\approx 3.94$ for Metric $k$-Means. Prior to our work, no such separation between general and Euclidean metrics was known for $k$-Median, $k$-Means, or Facility Location in terms of their approximability. Unlike prior dual fitting approaches for $k$-Means, our new dual fitting algorithm tightly accounts for dual payments while still facilitating an effective dual feasibility analysis. We introduce a new framework that uses spectral analysis for determining the approximation factor of our algorithm.
We give a deterministic $(1.3865+\epsilon)$-approximation for correlation clustering on complete graphs, improving the previous best factor of $1.485+\epsilon$ of Cao et al. (STOC'24). Our first main contribution is an efficient weak separation oracle for the cluster-LP dual. Given signed vertex weights $q$, it either...
David Garc'ia-Soriano, A. Schohn· arXiv.org· 2 citations
We show that, for every pair of convex bodies $K,L\subset\mathbb R^n$, $$ \operatorname{vr}(K,L)\leq C\sqrt{n\log(n+1)}. $$ The main point is to place $K$ and $L^\circ$ in isotropic position. We then consider a random orthogonal image of $L$ and control the corresponding operator norm by combining the isotropic mean-ga...
Daniel Galicer, Mariano Merzbacher, Damián Pinasco· 0 citations
We present randomized algorithms for the shortest vector problem (SVP). For the $n$-dimensional lattice $\mathcal L$, our algorithms solve SVP in time $2^{0.6039n+o(n)}$ classically and $2^{0.5411n+o(n)}$ quantumly and space $2^{0.5n+o(n)}$, improving the previous best algorithm running in $2^{n+o(n)}$ time and space o...
Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in machine learning applications. We study fair $k$-means clustering in Euclidean space, where the proportion of each protected group in every cluster must lie within specified...
Kang Cheng, Guan-Lin Mo, Shi-Hong Song et al.· 0 citations
Metric decompositions are a fundamental tool in the design of algorithms involving distances. We study fast algorithms for sampling from probabilistic metric decompositions of $n$-point sets in $\ell_\infty$ and $\ell_2$ spaces of high dimension $d$. For $\ell_\infty$, we design a padded-decomposition algorithm that ru...
Robert Krauthgamer, Asaf Petruschka, Nir Petruschka· Embedded Systems and Applica...· 0 citations
Let $1\leq k\leq n$. We prove that $k$-dimensional intrinsic Lipschitz graphs in the Heisenberg group $\mathbb{H}^n$ satisfy a geometric lemma $\mathrm{GLem}(\beta_{2,\mathcal{V}_k},p)$ for horizontal $\beta$-numbers with an exponent $p=p(k)$. Previously, this result was known only in the case $k=1$; our proof recovers...
Yi-Bo Chen, Katrin Fässler, Kilian Zambanini University of Jyväskylä 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.
