arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.12897cs.DS
收藏

低维公路图聚类的多项式时间逼近方案

Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs

Andreas Emil Feldmann, David Saulpic

摘要:

我们研究聚类问题,如k-Median,k-Means,和设施位置的低维公路图,这是一个图形参数建模的交通网络。之前已经证明了这些问题的近似方案存在,它们可以在准多项式时间内运行(假设高速公路维度恒定)[Feldmann et al. SICOMP 2018],也可以在FPT时间内运行(通过聚类数$k$、高速公路维度和近似因子进行参数化)[Becker et al. ESA~2018,Braverman et al. 2020]。在本文中,我们表明,多项式时间近似方案(PTAS)存在(假设恒定的公路尺寸)。我们还表明,所考虑的问题是NP-困难的公路维数为1的图。

英文摘要:

We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highway dimension, which is a graph parameter modeling transportation networks. It was previously shown that approximation schemes for these problems exist, which either run in quasi-polynomial time (assuming constant highway dimension) [Feldmann et al. SICOMP 2018] or run in FPT time (parameterized by the number of clusters $k$, the highway dimension, and the approximation factor) [Becker et al. ESA~2018, Braverman et al. 2020]. In this paper we show that a polynomial-time approximation scheme (PTAS) exists (assuming constant highway dimension). We also show that the considered problems are NP-hard on graphs of highway dimension 1.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑