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