arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.4444math.OC
收藏

L-可扩函数与最小费用多流问题的邻近尺度算法

L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem

Hiroshi Hirai

摘要:

本文提出了一类新的离散凸函数的理论,称为L-可扩函数和交错L-凸函数,它们定义在树的乘积上。我们建立优化的基本属性:局部到全局的最优性标准,最陡下降算法连续$k$ -次模函数最小化,持久性,和邻近定理。我们的理论是由最小成本的自由多流问题。针对这一问题,Goldberg和Karzanov给出了两个基于容量和费用缩放的组合弱多项式时间算法,但没有显式的运行时间。作为该理论的应用,我们提出了一种新的简单多项式邻近标度算法来求解$O(n \log (n AC) {\rm MF}(kn, km))$时间内的最小无代价多流问题,其中$n$是节点数,$m$是边数,$k$是终端数,$A$是边代价最大值,$C$是边容量之和,以及${\rm MF}(n',m')$表示在$n'$节点和$m'$边的网络中找到最大流的时间复杂度。我们的算法被设计来解决,在相同的时间复杂度,更一般的一类多流问题,最小成本的节点需求多流问题,是第一个组合多项式时间算法这类问题。最后给出了网络设计问题的一个应用。

英文摘要:

In this paper, we develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a local-to-global optimality criterion, the steepest descend algorithm by successive $k$-submodular function minimizations, the persistency property, and the proximity theorem. Our theory is motivated by minimum cost free multiflow problem. To this problem, Goldberg and Karzanov gave two combinatorial weakly polynomial time algorithms based on capacity and cost scalings, without explicit running time. As an application of our theory, we present a new simple polynomial proximity scaling algorithm to solve minimum cost free multiflow problem in $O(n \log (n AC) {\rm MF}(kn, km))$ time, where $n$ is the number of nodes, $m$ is the number of edges, $k$ is the number of terminals, $A$ is the maximum of edge-costs, $C$ is the total sum of edge-capacities, and ${\rm MF}(n',m')$ denotes the time complexity to find a maximum flow in a network of $n'$ nodes and $m'$ edges. Our algorithm is designed to solve, in the same time complexity, a more general class of multiflow problems, minimum cost node-demand multiflow problem, and is the first combinatorial polynomial time algorithm to this class of problems. We also give an application to network design problem.

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

↑