arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.04696math.OCcs.DS
收藏

具有一致需求的鲁棒能力约束树和网络

Robust capacitated trees and networks with uniform demands

Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont

摘要:

我们感兴趣的鲁棒(或弹性)容量限制根Steiner网络的终端的情况下,统一的需求的设计。形式上,我们给出了一个图,容量和费用函数的边缘,根,一个子集的节点称为终端,和边界k的边缘故障的数量。我们首先研究的问题,其中k = 1和网络,我们要设计的必须是一棵树,覆盖的根和终端:我们给出了复杂性的结果,并提出模型,以优化树的成本和终端的数量从根断开的最坏情况下的边缘故障,同时尊重边缘的容量约束。其次,我们考虑计算最小成本可生存网络的问题,即,即使在去除任何k个边缘之后,也覆盖根和终端的网络,同时仍然遵守边缘上的容量约束。我们还考虑了保护给定数量的边缘的可能性。我们提出了三种不同的配方:一个割集为基础的配方,一个流为基础的,和一个双层(与攻击者和防御者)。我们提出了算法来解决每个配方,并比较它们的效率。

英文摘要:

We are interested in the design of robust (or resilient) capacitated rooted Steiner networks in case of terminals with uniform demands. Formally, we are given a graph, capacity and cost functions on the edges, a root, a subset of nodes called terminals, and a bound k on the number of edge failures. We first study the problem where k = 1 and the network that we want to design must be a tree covering the root and the terminals: we give complexity results and propose models to optimize both the cost of the tree and the number of terminals disconnected from the root in the worst case of an edge failure, while respecting the capacity constraints on the edges. Second, we consider the problem of computing a minimum-cost survivable network, i.e., a network that covers the root and terminals even after the removal of any k edges, while still respecting the capacity constraints on the edges. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set based formulation, a flow based one, and a bilevel one (with an attacker and a defender). We propose algorithms to solve each formulation and compare their efficiency.

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

↑