We consider the popular $k$-means problem in $d$-dimensional Euclidean space. Recently Friggstad, Rezapour, Salavatipour [FOCS'16] and Cohen-Addad, Klein, Mathieu [FOCS'16] showed that the standard local search algorithm yields a $(1+ε)$-approximation in time $(n \cdot k)^{1/ε^{O(d)}}$, giving the first polynomial-time approximation scheme for the problem in low-dimensional Euclidean space. While local search achieves optimal approximation guarantees, it is not competitive with the state-of-the-art heuristics such as the famous $k$-means++ and $D^2$-sampling algorithms.
In this paper, we aim at bridging the gap between theory and practice by giving a $(1+ε)$-approximation algorithm for low-dimensional $k$-means running in time $n \cdot k \cdot (\log n)^{(dε^{-1})^{O(d)}}$, and so matching the running time of the $k$-means++ and $D^2$-sampling heuristics up to polylogarithmic factors. We speed-up the local search approach by making a non-standard use of randomized dissections that allows to find the best local move efficiently using a quite simple dynamic program. We hope that our techniques could help design better local search heuristics for geometric problems. We note that the doubly exponential dependency on $d$ is necessary as $k$-means is APX-hard in dimension $d = ω(\log n)$.
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs
我们研究聚类问题,如k-Median,k-Means,和设施位置的低维公路图,这是一个图形参数建模的交通网络。之前已经证明了这些问题的近似方案存在,它们可以在准多项式时间内运行(假设高速公路维度恒定)[Feldmann et al. SICOMP 2018],也可以在FPT时间内运行(通过聚类数$k$、高速公路维度和近似因子进行参数化)[Becker et al. ESA~2018,Braverman et al. 2020]。在本文中,我们表明,多项式时间近似方案(PTAS)存在(假设恒定的公路尺寸)。我们还表明,所考虑的问题是NP-困难的公路维数为1的图。
Improved approximation schemes for early work scheduling on identical parallel machines with common due date
本文研究了以最大化总提前工作量为目标的同类平行机提前工作排序问题,在一个共同的到期日之前执行的非抢占式作业的部分。通过预处理和构造具有多个良好性质的辅助实例,我们提出了一种高效的具有运行时间的多项式时间逼近方案$O(n)$,改进了[Györgyi,P.,Kis,T.(2020年)。早期工作、后期工作和资源均衡问题的通用近似框架。{ \it European Journal of Operational Research},286(1),129-137],以及当机器的数量是固定数量时具有运行时间的完全多项式时间近似方案$O(n)$,其改进了[Chen,X.,梁玉,Sterna,M.,王伟,Baewicz,J.(2020 b)。在具有共同交货期的并行机上最大化早期工作的全多项式时间近似方案。{ \it European Journal of Operational Research},284(1),67-74],其中$n$是作业的数量,隐藏常数取决于所需的精度。
A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions
给定n个具有非负整数权重w1,...的元素,wn和一个整数容量C,我们考虑经典背包问题的计数版本:找到不同子集的数量,这些子集的权重加起来至多等于给定的容量。我们给出了一个确定性的算法,估计的解决方案的数量在相对误差1+-eps在时间多项式n和1/eps(完全多项式逼近方案)。时间复杂度为O(n^3(1/eps)log(n))。我们的算法是基于动态规划。在此之前,随机多项式时间近似方案首先由Morris和Sinclair通过Markov chain Monte Carlo技术已知,随后由Dyer通过动态规划和拒绝采样已知。