中文

关于 Steiner 树有向分量松弛的整数性间隙

数据结构与算法 2011-12-06 v2

摘要

在本注记中,我们证明了 Byrka, Grandoni, Rothvob 和 Sanita (STOC 2010) 提出的针对 Steiner 树问题的 kk-有向分量松弛 (kk-DCR) 线性规划的整数性间隙至多为 ln(4)<1.39\ln(4)<1.39。该证明是构造性的:我们可以有效地找到一个 Steiner 树,其成本至多为 kk-DCR LP 给出的最优分数 kk-限制 Steiner 树成本的 ln(4)\ln(4) 倍。

关键词

引用

@article{arxiv.1111.6698,
  title  = {On the Integrality Gap of the Directed-Component Relaxation for Steiner Tree},
  author = {Mohammad Taghi Hajiaghayi and Shi Li},
  journal= {arXiv preprint arXiv:1111.6698},
  year   = {2011}
}

备注

This paper has been withdrawn due to a crucial error in Lemma 4. In Lemma 4, additional property for $\{Y'_j\}$ is needed to guarantee that the family of distributions exists. However, we can not guarantee the condition for every iteration