Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP

作者：Cheriyan Joseph^*; Gao Zhihan

来源：Algorithmica, 2018, 80(2): 530-559.

DOI：10.1007/s00453-016-0270-4

• Approximation algorithms
• Lift-and-Project
• Linear programming
• Semidefinite programming
• Network design
• Algorithmic aspects of networks
• Graph connectivity
• Connectivity augmentation

In Part I, we study a special case of the unweighted Tree Augmentation Problem (TAP) via the Lasserre (Sum of Squares) system. In the special case, we forbid so-called stems; these are a particular type of subtree configuration. For stemless TAP, we prove that the integrality ratio of an SDP relaxation (the Lasserre tightening of an LP relaxation) is , where can be any small constant. We obtain this result by designing a polynomial-time algorithm for stemless TAP that achieves an approximation guarantee of relative to the SDP relaxation. The algorithm is combinatorial and does not solve the SDP relaxation, but our analysis relies on the SDP relaxation. We generalize the combinatorial analysis of integral solutions from the previous literature to fractional solutions by identifying some properties of fractional solutions of the Lasserre system via the decomposition result of Karlin et al. (Integer programming and combinatoral optimization (IPCO), Lecture Notes in Computer Science, vol 6655. Springer, Berlin/Heidelberg, pp 301-314, 2011). Also, we present an example of stemless TAP such that the approximation guarantee of is tight for the algorithm. In Part II of this paper, we extend the methods of Part I to prove the same results relative to the same SDP relaxation for TAP.

• 出版日期2018-2