有向割松弛用于Steiner树:更好的整数规划间隙界限及moat生长的极限
The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing
AI总结:
该研究改进了Steiner树问题中双向割松弛的整数规划间隙上界,证明其至多为1.898,并探讨了moat生长算法的极限。
摘要:
Steiner树问题要求在无向图中以最便宜的方式连接给定的顶点子集。最著名的线性规划松弛之一是双向割松弛(BCR)。确定该松弛的整数规划间隙是一个长期存在的开放问题。数十年来,已知的最佳上界为2,可通过标准技术实现。仅在最近,Byrka、Grandoni和Traub[FOCS 2024]证明了BCR的整数规划间隙严格低于2。我们证明BCR的整数规划间隙至多为1.898,显著改进了之前的上界1.9988。对于重要的特殊情况,当终端最小生成树是优化的Steiner树时,我们证明整数规划间隙至多为12/7,通过提供Byrka等人双增长过程的紧分析。为了获得一般上界1.898,我们将他们的双增长过程推广到广泛的moat生长算法类别中。此外,我们证明没有任何此类moat生长算法能产生证明整数规划间隙低于12/7的对偶解。最后,我们注意到与超图松弛的有趣联系。
英文摘要:
The Steiner Tree problem asks for the cheapest way of connecting a given subset of the vertices in an undirected graph. One of the most prominent linear programming relaxations for Steiner Tree is the Bidirected Cut Relaxation (BCR). Determining the integrality gap of this relaxation is a long-standing open question. For several decades, the best known upper bound was 2, which is achievable by standard techniques. Only very recently, Byrka, Grandoni, and Traub [FOCS 2024] showed that the integrality gap of BCR is strictly below 2. We prove that the integrality gap of BCR is at most 1.898, improving significantly on the previous bound of 1.9988. For the important special case where a terminal minimum spanning tree is an optimal Steiner tree, we show that the integrality gap is at most 12/7, by providing a tight analysis of the dual-growth procedure by Byrka et al. To obtain the general bound of 1.898 on the integrality gap, we generalize their dual growth procedure to a broad class of moat-growing algorithms. Moreover, we prove that no such moat-growing algorithm yields dual solutions certifying an integrality gap below 12/7. Finally, we observe an interesting connection to the Hypergraphic Relaxation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。