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

星型路径:介于车辆路径和顶点覆盖之间

Star Routing: Between Vehicle Routing and Vertex Cover

Diego Delle Donne, Guido Tagliavini

摘要:

我们考虑一个实际的报纸公司,其中包括计算的最小长度路线的送货卡车,使司机只停在街道交叉口,每次提供副本给所有客户相邻的交叉口的优化问题。这可以被建模为一个抽象问题,该抽象问题采用未加权的简单图$G = (V, E)$和边的子集$X$,并要求最短的循环,不一定是简单的,使得$X$的每条边在循环中都有端点。我们表明,决策版本的问题是强NP-完全的,即使$G$是一个网格图。关于近似的解决方案,我们表明,一般情况下的问题是APX硬,因此没有PTAS是可能的,除非P $=$ NP。尽管近似的硬度,我们表明,任何$α$近似算法度量TSP,我们可以建立一个$3α$近似算法,我们的优化问题,产生一个具体的$9/2$近似算法。网格的情况特别重要,因为它模拟了城市地图或其中的一部分,通常的情况是有一些充满客户的社区,这可以转化为抽象问题的实例,其中几乎$G$的每一条边都在$X$中。我们这个属性的模型为$|E - X| = o(|E|)$,并为这些情况下,我们给出了一个$(3/2 + \varepsilon)$的近似算法,对于任何$\varepsilon > 0$,只要网格足够大。

英文摘要:

We consider an optimization problem posed by an actual newspaper company, which consists of computing a minimum length route for a delivery truck, such that the driver only stops at street crossings, each time delivering copies to all customers adjacent to the crossing. This can be modeled as an abstract problem that takes an unweighted simple graph $G = (V, E)$ and a subset of edges $X$ and asks for a shortest cycle, not necessarily simple, such that every edge of $X$ has an endpoint in the cycle. We show that the decision version of the problem is strongly NP-complete, even if $G$ is a grid graph. Regarding approximate solutions, we show that the general case of the problem is APX-hard, and thus no PTAS is possible unless P $=$ NP. Despite the hardness of approximation, we show that given any $α$-approximation algorithm for metric TSP, we can build a $3α$-approximation algorithm for our optimization problem, yielding a concrete $9/2$-approximation algorithm. The grid case is of particular importance, because it models a city map or some part of it. A usual scenario is having some neighborhood full of customers, which translates as an instance of the abstract problem where almost every edge of $G$ is in $X$. We model this property as $|E - X| = o(|E|)$, and for these instances we give a $(3/2 + \varepsilon)$-approximation algorithm, for any $\varepsilon > 0$, provided that the grid is sufficiently big.

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

↑