具有区间费用的鲁棒可恢复生成树问题是多项式可解的
The robust recoverable spanning tree problem with interval costs is polynomially solvable
摘要：
研究了具有区间边代价的鲁棒可恢复生成树问题。这一问题的复杂性至今仍未定论。它表明，该问题是多项式可解的，通过使用迭代松弛方法。一个推广的鲁棒可恢复拟阵基问题。多项式算法的鲁棒可恢复的问题提出。
英文摘要：
In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the problem is polynomially solvable, by using an iterative relaxation method. A generalization of this idea to the robust recoverable matroid basis problem is also presented. Polynomial algorithms for both robust recoverable problems are proposed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
