No. Title Author Year
1 Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices Dvorák, Pavel et al. 2018
2 The Parameterized Hardness of the k-Center Problem in Transportation Networks Feldmann, Andreas Emil et al. 2018
3 Fast Approximation Algorithms for the Generalized Survivable Network Design Problem Feldmann, Andreas Emil et al. 2016
4 The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems Feldmann, Andreas Emil et al. 2016
5 On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree Feldmann, Andreas Emil et al. 2014
6 Balanced Partitions of Trees and Applications Feldmann, Andreas Emil et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 6


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