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

路上不可分流的常因子近似算法

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

Paul Bonsma, Jens Schulz, Andreas Wiese

摘要:

在路径上的不可拆分流问题中,我们给出了一条容量受限的路径$P$和$n$任务,每个任务都有一个需求,一个利润,以及起点和终点。目标是计算任务的最大利润集合,使得对于$P$的每个边缘$e$,使用$e$的所选任务的总需求不超过$e$的容量。这是一个研究得很好的问题,已经研究了替代名称,如资源分配,带宽分配,资源约束调度,时间背包和间隔包装。我们提出了一个多项式时间常数因子近似算法。这改进了以前最好的已知近似比的$O(\log n)$。对于任意的$ε>0$,我们的算法的逼近比为$7+ε$.我们介绍了几种新的算法技术,这可能是独立的兴趣:一个框架,减少了问题的实例与有界范围的能力,和一个新的几何启发的动态程序,解决了一个特殊情况下的最大重量独立的矩形问题的最优性。在资源增加的情况下,在容量可以轻微违反的情况下,我们给出了一个$(2+ε)$ -近似算法。此外,我们表明,该问题是强NP-困难的,即使所有的边缘容量是相等的,所有的需求是~1,~2,或~3。

英文摘要:

In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge $e$ of $P$, the total demand of selected tasks that use $e$ does not exceed the capacity of $e$. This is a well-studied problem that has been studied under alternative names, such as resource allocation, bandwidth allocation, resource constrained scheduling, temporal knapsack and interval packing. We present a polynomial time constant-factor approximation algorithm for this problem. This improves on the previous best known approximation ratio of $O(\log n)$. The approximation ratio of our algorithm is $7+ε$ for any $ε>0$. We introduce several novel algorithmic techniques, which might be of independent interest: a framework which reduces the problem to instances with a bounded range of capacities, and a new geometrically inspired dynamic program which solves a special case of the maximum weight independent set of rectangles problem to optimality. In the setting of resource augmentation, wherein the capacities can be slightly violated, we give a $(2+ε)$-approximation algorithm. In addition, we show that the problem is strongly NP-hard even if all edge capacities are equal and all demands are either~1,~2, or~3.

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

↑