首页> 外文会议>International conference on integer programming and combinatorial optimization >Linear Programming Hierarchies Suffice for Directed Steiner Tree
【24h】

Linear Programming Hierarchies Suffice for Directed Steiner Tree

机译:定向Steiner树的线性规划层次结构就足够了

获取原文

摘要

We demonstrate that ℓ rounds of the Sherali-Adams hierarchy and 2ℓ rounds of the Lovasz-Schrijver hierarchy suffice to reduce the integrality gap of a natural LP relaxation for Directed Steiner Tree in ℓ-layered graphs from Ω(k~(1/2)) to O(ℓ·log k) where k is the number of terminals. This is an improvement over Rothvoss' result that 2ℓ rounds of the considerably stronger Lasserre SDP hierarchy reduce the integrality gap of a similar formulation to O(ℓ·log k). We also observe that Directed Steiner Tree instances with 3 layers of edges have only an O(log k) integrality gap in the standard LP relaxation, complementing the known fact that the gap can be as large as Ω(k~(1/2)) in graphs with 4 layers.
机译:我们证明了Sherali-Adams层次的ℓ轮和Lovasz-Schrijver层次的2ℓ轮足以减少Ω(k〜(1/2))ℓ层图中定向Steiner树的自然LP松弛的完整性缺口。 )到O(ℓ·log k),其中k是终端数。这是对Rothvoss结果的改进,Rothvoss结果的2轮明显更强的Lasserre SDP层次减少了与O(ℓ·log k)相似的公式的完整性差距。我们还观察到,具有3层边缘的定向Steiner树实例在标准LP弛豫中仅具有O(log k)完整性间隙,补充了已知的事实,即间隙可能高达Ω(k〜(1/2) )在具有4层的图形中。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号