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

最大$L$ -有界流的多项式时间组合算法

On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow

Kateřina Altmanová, Petr Kolman, Jan Voborník

摘要:

给定一个图$G=(V,E)$,它有两个不同的顶点$s,t\in V$和一个整数$L$,{ \em $L$ -有界流}是$s$和$t$之间的流,它可以分解为长度至多为$L$的路。在{ \em最大$L$ -有界流问题}中,任务是在输入图中的给定顶点对之间找到最大$L$ -有界流。该问题可以使用线性规划在多项式时间内解决。然而,据我们所知,没有多项式时间的组合算法的$L$有界流是已知的。唯一的尝试,我们都知道,描述一个组合算法的最大$L$有界流问题是由Koubek和Kouriha在1981年。不幸的是,他们的论文包含实质性的缺陷和算法不工作;在本文的第一部分,我们描述了这些问题。在本文的第二部分中,我们描述了一个组合算法的基础上的指数长度的方法,找到一个$(1+ε)$ -近似的最大$L$ -有界流的时间$O(ε^{-2}m^2 L\log L)$其中$m$是在图中的边数。此外,我们表明,这种方法的工作,即使是NP-困难的推广的最大$L$有界流问题,其中每个边缘有一个长度。

英文摘要:

Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an {\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\em maximum $L$-bounded flow problem} the task is to find a maximum $L$-bounded flow between a given pair of vertices in the input graph. The problem can be solved in polynomial time using linear programming. However, as far as we know, no polynomial-time combinatorial algorithm for the $L$-bounded flow is known. The only attempt, that we are aware of, to describe a combinatorial algorithm for the maximum $L$-bounded flow problem was done by Koubek and Ří ha in 1981. Unfortunately, their paper contains substantional flaws and the algorithm does not work; in the first part of this paper, we describe these problems. In the second part of this paper we describe a combinatorial algorithm based on the exponential length method that finds a $(1+ε)$-approximation of the maximum $L$-bounded flow in time $O(ε^{-2}m^2 L\log L)$ where $m$ is the number of edges in the graph. Moreover, we show that this approach works even for the NP-hard generalization of the maximum $L$-bounded flow problem in which each edge has a length.

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

↑