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

从K森林拨号兜风

Dial a Ride from k-forest

Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi

摘要:

k-森林问题是k-最小生成树问题和稠密$k$ -子图问题的一个共同推广。形式上,给定$n$顶点$V$上的度量空间,具有$m$需求对$\subseteq V \times V$和"目标“$k\le m$,目标是找到连接至少$k$需求对的最小成本子图。本文对Segev & Segev提出的$O(n^{2/3}\log n)$的最佳比进行了改进,给出了$k$ -森林的一个$O(\min\{\sqrt{n},\sqrt{k}\})$ -近似算法.然后,我们应用我们的算法k-森林获得近似算法的几个拨号乘车问题。基本的Dial-a-Ride问题如下:给定一个$n$点度量空间,其中包含$m$对象,每个对象都有自己的源和目的地,并且车辆能够在任何时候携带最多$k$对象,找到使用此车辆将每个对象从其源移动到目的地的最小长度行程。我们证明了$k$森林问题的$α$ -近似算法意味着Dial-a-Ride的$O(α\cdot\log^2n)$ -近似算法。利用我们对$k$ -森林的结果,我们得到了一个关于Dial-a-Ride的$O(\min\{\sqrt{n},\sqrt{k}\}\cdot\log^2 n)$ -近似算法.以前唯一已知的结果是一个$O(\sqrt{k}\log n)$近似Charikar&Raghavachari;我们的结果给出了一个类似的近似保证不同的证明-事实上,当车辆容量$k$是大的,我们给他们的结果略有改善。

英文摘要:

The k-forest problem is a common generalization of both the k-MST and the dense-$k$-subgraph problems. Formally, given a metric space on $n$ vertices $V$, with $m$ demand pairs $\subseteq V \times V$ and a ``target'' $k\le m$, the goal is to find a minimum cost subgraph that connects at least $k$ demand pairs. In this paper, we give an $O(\min\{\sqrt{n},\sqrt{k}\})$-approximation algorithm for $k$-forest, improving on the previous best ratio of $O(n^{2/3}\log n)$ by Segev & Segev. We then apply our algorithm for k-forest to obtain approximation algorithms for several Dial-a-Ride problems. The basic Dial-a-Ride problem is the following: given an $n$ point metric space with $m$ objects each with its own source and destination, and a vehicle capable of carrying at most $k$ objects at any time, find the minimum length tour that uses this vehicle to move each object from its source to destination. We prove that an $α$-approximation algorithm for the $k$-forest problem implies an $O(α\cdot\log^2n)$-approximation algorithm for Dial-a-Ride. Using our results for $k$-forest, we get an $O(\min\{\sqrt{n},\sqrt{k}\}\cdot\log^2 n)$- approximation algorithm for Dial-a-Ride. The only previous result known for Dial-a-Ride was an $O(\sqrt{k}\log n)$-approximation by Charikar & Raghavachari; our results give a different proof of a similar approximation guarantee--in fact, when the vehicle capacity $k$ is large, we give a slight improvement on their results.

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

↑