No. Title Author Year
1 On the Integrality Gap of the Prize-Collecting Steiner Forest LP Könemann, Jochen et al. 2017
2 A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs Friggstad, Zachary et al. 2016
3 Fast Approximation Algorithms for the Generalized Survivable Network Design Problem Feldmann, Andreas Emil et al. 2016
4 On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree Feldmann, Andreas Emil et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 4

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI