No. Title Author Year
1 Spanning Trees With Edge Conflicts and Wireless Connectivity Halldórsson, Magnús M. et al. 2018
2 Bicovering: Covering Edges With Two Small Subsets of Vertices Bhangale, Amey et al. 2016
3 LP-Relaxations for Tree Augmentation Kortsarz, Guy et al. 2016
4 The Densest k-Subhypergraph Problem Chlamtac, Eden et al. 2016
5 Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights Dinitz, Michael et al. 2014
6 Approximating minimum cost connectivity problems Kortsarz, Guy et al. 2010
7 Approximating Fault-Tolerant Group-Steiner Problems Khandekar, Rohit et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 7

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