Linear Programming Hierarchies Suffice for Directed Steiner Tree
From MaRDI portal
Publication:5419003
DOI10.1007/978-3-319-07557-0_24zbMath1418.90223OpenAlexW2228866060MaRDI QIDQ5419003
Mohammad Shadravan, Madhur Tulsiani, Zachary Friggstad, Young Kun-Ko, Jochen Könemann, Anand Louis
Publication date: 2 June 2014
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_24
Related Items (9)
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm ⋮ On approximating degree-bounded network design problems ⋮ Lehman's Theorem and the Directed Steiner Tree Problem ⋮ Max-Cut Under Graph Constraints ⋮ Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ A Comprehensive Analysis of Polyhedral Lift-and-Project Methods ⋮ Approximating graph-constrained max-cut
This page was built for publication: Linear Programming Hierarchies Suffice for Directed Steiner Tree
