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

一般簇路由问题的近似算法

Approximation algorithms for general cluster routing problem

Xiaoyan Zhang, Donglei Du, Gregory Gutin, Qiaoxia Ming, Jian Sun

摘要:

图路由问题由于其普遍性和广泛的应用,在运筹学、计算机科学和工程领域得到了广泛的研究。在本文中,我们研究常数近似算法的一般集群路由问题的一些变化。在这个问题中,我们给出了一个边加权的完全无向图$G=(V,E,c),$,它的顶点集被划分成簇$C_{1},\dots ,C_{k}.$。我们还给出了$V$的一个子集$V'$和$E.$的一个子集$E'$,权函数$c$满足三角不等式。目标是找到一个最小成本的步行$T$,该步行$T$仅访问$V'$中的每个顶点一次,至少遍历$E'$中的每个边一次,并且对于每个$i\in [k]$,连续遍历$C_i$的所有顶点。

英文摘要:

Graph routing problems have been investigated extensively in operations research, computer science and engineering due to their ubiquity and vast applications. In this paper, we study constant approximation algorithms for some variations of the general cluster routing problem. In this problem, we are given an edge-weighted complete undirected graph $G=(V,E,c),$ whose vertex set is partitioned into clusters $C_{1},\dots ,C_{k}.$ We are also given a subset $V'$ of $V$ and a subset $E'$ of $E.$ The weight function $c$ satisfies the triangle inequality. The goal is to find a minimum cost walk $T$ that visits each vertex in $V'$ only once, traverses every edge in $E'$ at least once and for every $i\in [k]$ all vertices of $C_i$ are traversed consecutively.

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

↑