预算约束下的割问题
Budget-constrained cut problems
AI总结:
本文研究带边切割成本和预算约束的最小割与最大割扩展问题,证明二者NP完全、分析性质,并提出精确算法及基于Lagrangean松弛的最小割非精确算法。
摘要:
无向边赋权图的最小割和最大割是图论中的经典问题。Min-Cut Problem可在P中求解,而Max-Cut Problem是NP完全的。人们已经开发了精确方法和启发式方法来求解它们。针对这两个问题,我们引入一种自然扩展,其中切割一条边会产生一项成本。我们的目标是找到一个割,使其割权之和最小,同时将其总切割成本限制在给定预算内。我们证明这两个受限问题均为NP完全,并研究了它们的一些性质。最后,我们开发了求解二者的精确算法,以及一种基于Lagrangean松弛、通常能给出最优解的最小割情形非精确算法。它们的性能通过大量计算实验予以报告。
英文摘要:
The minimum and maximum cuts of an undirected edge-weighted graph are classic problems in graph theory. While the Min-Cut Problem can be solved in P, the Max-Cut Problem is NP-Complete. Exact and heuristic methods have been developed for solving them. For both problems, we introduce a natural extension in which cutting an edge induces a cost. Our goal is to find a cut that minimizes the sum of the cut weights but, at the same time, restricts its total cut cost to a given budget. We prove that both restricted problems are NPComplete and we also study some of its properties. Finally, we develop exact algorithms to solve both as well as a non-exact algorithm for the min-cut case based on a Lagreangean relaxation that generally provides optimal solutions. Their performance is reported by an extensive computational experience.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。