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

运输网络k-中心问题的参数化难度

The Parameterized Hardness of the k-Center Problem in Transportation Networks

Andreas Emil Feldmann, Daniel Marx

摘要:

在本文中,我们研究的硬度$k$ -中心问题的输入模型的运输网络。对于该问题,给出了一个具有边长的图$G=(V,E)$和一个整数$k$,需要选择一个中心集$C\subseteq V$使得$|C|\leq k$ .目标是最小化图中任何顶点到最近中心的最大距离。这个问题出现在物流的许多应用中,因此考虑对运输网络进行建模的输入是很自然的。这样的输入通常被假设为平面图,低倍度量,或有界公路维数图。对于这些模型中的每一个,参数化近似算法已经被证明是存在的。我们补充这些结果,证明了$k$ -中心问题是W[1]-困难的常数倍维的平面图,其中的参数是组合的中心数$k$,公路尺寸$h$,和路径宽度$p$。此外,在指数时间假设下,对于任何可计算函数$f$都没有$f(k,p,h)\cdot n^{o(p+\sqrt{k+h})}$时间算法。因此,即使假设输入图同时符合上述所有交通网络模型,也不可能有效地找到$k$ -Center的最优解!此外,我们给出了一个简单的参数化$(1+\varepsilon)$ -近似算法的输入的两倍维$d$与运行时$(k^k/\varepsilon^{O(kd)})\cdot n^{O(1)}$。这推广了先前的结果,其考虑了$D$维$L_q$度量中的输入。

英文摘要:

In this paper we study the hardness of the $k$-Center problem on inputs that model transportation networks. For the problem, a graph $G=(V,E)$ with edge lengths and an integer $k$ are given and a center set $C\subseteq V$ needs to be chosen such that $|C|\leq k$. The aim is to minimize the maximum distance of any vertex in the graph to the closest center. This problem arises in many applications of logistics, and thus it is natural to consider inputs that model transportation networks. Such inputs are often assumed to be planar graphs, low doubling metrics, or bounded highway dimension graphs. For each of these models, parameterized approximation algorithms have been shown to exist. We complement these results by proving that the $k$-Center problem is W[1]-hard on planar graphs of constant doubling dimension, where the parameter is the combination of the number of centers $k$, the highway dimension $h$, and the pathwidth $p$. Moreover, under the Exponential Time Hypothesis there is no $f(k,p,h)\cdot n^{o(p+\sqrt{k+h})}$ time algorithm for any computable function $f$. Thus it is unlikely that the optimum solution to $k$-Center can be found efficiently, even when assuming that the input graph abides to all of the above models for transportation networks at once! Additionally we give a simple parameterized $(1+\varepsilon)$-approximation algorithm for inputs of doubling dimension $d$ with runtime $(k^k/\varepsilon^{O(kd)})\cdot n^{O(1)}$. This generalizes a previous result, which considered inputs in $D$-dimensional $L_q$ metrics.

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

↑