No. Title Author Year
1 Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network Babay, Amy et al. 2018
2 Distributed Distance-Bounded Network Design Through Distributed Convex Programming Dinitz, Michael et al. 2018
3 Large Low-Diameter Graphs are Good Expanders Dinitz, Michael et al. 2018
4 Approximating Approximate Distance Oracles Dinitz, Michael et al. 2017
5 Computing Approximate PSD Factorizations Basu, Amitabh et al. 2016
6 The Densest k-Subhypergraph Problem Chlamtac, Eden et al. 2016
7 Towards Resistance Sparsifiers Dinitz, Michael et al. 2015
8 Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights Dinitz, Michael et al. 2014
9 Lowest Degree k-Spanner: Approximation and Hardness Chlamtác, Eden et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 9


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