An LP-based 3/2-approximation algorithm for the graphic s-t path TSP - Zhihan Gao 002 (CoRR, 2013)

An LP-based 32-approximation algorithm for the s-ts-t path graph Traveling Salesman Problem. - Zhihan Gao 002 (Oper. Res. Lett., 2013)

On Linear Programming Relaxations for Unsplittable Flow in Trees. - Zachary Friggstad; Zhihan Gao 002 (APPROX-RANDOM, 2015)

Approximating Minimum-Cost Connected T-Joins. - Joseph Cheriyan; Zachary Friggstad; Zhihan Gao 002 (Algorithmica, 2015)

Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. - Zhihan Gao 002 (2015)

Approximating (Unweighted) Tree Augmentation via Lift-and-Project (Part 0: $1.8+ε$ approximation for (Unweighted) TAP). - Joseph Cheriyan; Zhihan Gao 002 (CoRR, 2016)

On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. - Joseph Cheriyan; Zhihan Gao 002; Konstantinos Georgiou; Sahil Singla 001 (Math. Program., 2016)

Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP. - Joseph Cheriyan; Zhihan Gao 002 (Algorithmica, 2018)

Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II. - Joseph Cheriyan; Zhihan Gao 002 (Algorithmica, 2018)

On the Metric s-t Path Traveling Salesman Problem. - Zhihan Gao 002 (SIAM Rev., 2018)