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