1. Arash Asadpour , Michel X. Goemans , Aleksander Mdry , Shayan Oveis Gharan, and Amin Saberi . 2017 . An O (log n /log log n )-Approximation Algorithm for the Asymmetric Traveling Salesman Problem. Operations Research , 65, 4 (2017). Arash Asadpour, Michel X. Goemans, Aleksander Mdry, Shayan Oveis Gharan, and Amin Saberi. 2017. An O (log n /log log n )-Approximation Algorithm for the Asymmetric Traveling Salesman Problem. Operations Research, 65, 4 (2017).
2. Negative dependence and the geometry of polynomials
3. Sylvia Boyd Joseph Cheriyan Robert Cummings Logan Grout Sharat Ibrahimpur Zoltán Szigeti and Lu Wang. 2020. A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. In APPROX/RANDOM Jarosł aw Byrka and Raghu Meka (Eds.). 176 Schloss Dagstuhl–Leibniz-Zentrum für Informatik 61:1–61:12. Sylvia Boyd Joseph Cheriyan Robert Cummings Logan Grout Sharat Ibrahimpur Zoltán Szigeti and Lu Wang. 2020. A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. In APPROX/RANDOM Jarosł aw Byrka and Raghu Meka (Eds.). 176 Schloss Dagstuhl–Leibniz-Zentrum für Informatik 61:1–61:12.
4. A 54-approximation for subcubic 2EC using circulations and obliged edges
5. Jaroslaw Byrka , Fabrizio Grandoni , and Afrouz Jabal Ameli . 2020. Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree . In STOC, Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy (Eds.). ACM , 815–825. Jaroslaw Byrka, Fabrizio Grandoni, and Afrouz Jabal Ameli. 2020. Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. In STOC, Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy (Eds.). ACM, 815–825.