单位扰动在广义生成树问题中的应用
Unit Perturbations in Budgeted Spanning Tree Problems
摘要:
图的最小生成树是一个研究得很好的结构,它是无数图论和优化问题的基础。我们研究的最小生成树(MST)扰动问题的目标是花费固定的预算,以增加边的权重,以增加尽可能多的MST的重量。两种流行的扰动模型是体积扰动和连续扰动。在体模型中,任何边的权重都可以精确地增加一次,达到某个预定的权重。在连续模型中,人们可以支付一小部分成本来按比例增加任何边的权重。Frederickson和Solis-Oba \cite{FS96}研究了这两个模型,并表明MST的整体扰动与$k$ -切割问题一样困难,而连续扰动模型在多时间内是可解的。在本文中,我们研究了这个问题的一个中间单位扰动变化,其中每个边的权重可以增加很多倍,但在一个整数单位的量每一次。我们提供了一个$(opt/2 -1)$ -近似多项式时间,其中$opt$是最佳的增加的重量。我们还研究了相关的双目标版本的问题,其中的目标是增加MST的重量的目标量,同时最大限度地减少扰动的成本。我们提供了一个$2$ -近似这种变化。此外,我们表明,假设小集扩展假设,这两个问题是很难近似。我们还指出了一个错误的证明中提供的Frederickson和Solis-Oba在\cite{FS96}关于他们的解决方案的连续扰动模型。虽然他们的算法是正确的,但他们的分析是有缺陷的。我们在这里提供了一个正确的证明。
英文摘要:
The minimum spanning tree of a graph is a well-studied structure that is the basis of countless graph theoretic and optimization problem. We study the minimum spanning tree (MST) perturbation problem where the goal is to spend a fixed budget to increase the weight of edges in order to increase the weight of the MST as much as possible. Two popular models of perturbation are bulk and continuous. In the bulk model, the weight of any edge can be increased exactly once to some predetermined weight. In the continuous model, one can pay a fractional amount of cost to increase the weight of any edge by a proportional amount. Frederickson and Solis-Oba \cite{FS96} have studied these two models and showed that bulk perturbation for MST is as hard as the $k$-cut problem while the continuous perturbation model is solvable in poly-time. In this paper, we study an intermediate unit perturbation variation of this problem where the weight of each edge can be increased many times but at an integral unit amount every time. We provide an $(opt/2 -1)$-approximation in polynomial time where $opt$ is the optimal increase in the weight. We also study the associated dual targeted version of the problem where the goal is to increase the weight of the MST by a target amount while minimizing the cost of perturbation. We provide a $2$-approximation for this variation. Furthermore we show that assuming the Small Set Expansion Hypothesis, both problems are hard to approximate. We also point out an error in the proof provided by Frederickson and Solis-Oba in \cite{FS96} with regard to their solution to the continuous perturbation model. Although their algorithm is correct, their analysis is flawed. We provide a correct proof here.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。