Abstract
We demonstrate that ℓ rounds of the Sherali-Adams hierarchy and 2ℓ rounds of the Lovász-Schrijver hierarchy suffice to reduce the integrality gap of a natural LP relaxation for Directed Steiner Tree in ℓ-layered graphs from \(\Omega(\sqrt k)\) to O(ℓ·logk) 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(ℓ·logk).
We also observe that Directed Steiner Tree instances with 3 layers of edges have only an O(logk) integrality gap in the standard LP relaxation, complementing the known fact that the gap can be as large as \(\Omega(\sqrt k)\) in graphs with 4 layers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Calinescu, G., Zelikovsky, G.: The polymatroid Steiner problems. J. Combinatorial Optimization 9(3), 281–294 (2005)
Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73–91 (1999)
Chlamtáč, E., Tulsiani, M.: Convex relaxations and integrality gaps. In: Handbook on Semidefinite. Springer (2012)
Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66–84 (2000)
Gupta, A., Talwar, K., Witmer, D.: Sparsest cut on bounded treewidth graphs: algorithms and hardness results. In: Proceedings of STOC (2013)
Guruswami, V., Sinop, A.K.: Faster SDP hierarchy solvers for local rounding algorithms. In: Proceedings of FOCS (2012)
Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of STOC (2003)
Karlin, A., Mathieu, C., Nguyen, C.: Integrlaity gaps of linear and semidefinite programming relaxations for knapsack. In: Proceedings of IPCO (2011)
Rothvoss, T.: Directed Steiner tree and the Lasserre hierarchy. CoRR abs/1111.5473 (2011)
Sherali, H., Adams, W.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411–430 (1990)
Zelikovsky, A.: A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18, 99–110 (1997)
Zosin, L., Khuller, S.: On directed Steiner trees. In: Proceedings of SODA (2002)
Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1, 166–190 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Friggstad, Z., Könemann, J., Kun-Ko, Y., Louis, A., Shadravan, M., Tulsiani, M. (2014). Linear Programming Hierarchies Suffice for Directed Steiner Tree. In: Lee, J., Vygen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2014. Lecture Notes in Computer Science, vol 8494. Springer, Cham. https://doi.org/10.1007/978-3-319-07557-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-07557-0_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07556-3
Online ISBN: 978-3-319-07557-0
eBook Packages: Computer ScienceComputer Science (R0)