arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.02282cs.DSmath.OC
收藏

预算约束最小费用流的复杂性与可逼近性

On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows

Michael Holzhauser, Sven O. Krumke, Clemens Thielen

摘要:

本文研究了带约束的最小费用流问题的复杂性和可逼近性,该问题是传统最小费用流问题的一种扩展,通过引入与每条边相关的第二类费用,其在可行流中的总价值受到给定预算B的约束.这个问题可以,例如,可看作是ε-约束方法在双准则最小费用流问题中的应用。我们证明了我们可以在弱多项式时间$O(\log M \cdot MCF(m,n,C,U))$内精确地求解该问题,其中C,U和M分别是输入中出现的任意数的最大绝对费用、最大容量和最大绝对值的上界,MCF(m,n,C,U)表示寻找传统最小费用流的复杂性.此外,我们提出了两个完全多项式时间的近似计划的问题一般图和一个改进的运行时间的问题的无圈图。

英文摘要:

We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. This problem can, e.g., be seen as the application of the ε-constraint method to the bicriteria minimum cost flow problem. We show that we can solve the problem exactly in weakly polynomial time $O(\log M \cdot MCF(m,n,C,U))$, where C, U, and M are upper bounds on the largest absolute cost, largest capacity, and largest absolute value of any number occuring in the input, respectively, and MCF(m,n,C,U) denotes the complexity of finding a traditional minimum cost flow. Moreover, we present two fully polynomial-time approximation schemes for the problem on general graphs and one with an improved running-time for the problem on acyclic graphs.

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

↑