We stand with Ukraine  

Zhihan Gao

Affiliations:
  • University of Waterloo, Waterloo, ON, Canada


According to our database1, Zhihan Gao authored at least 10 papers between 2013 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II.
[BibTeX]
[DOI]
Joseph Cheriyan
,
Zhihan Gao
Algorithmica, 2018

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

2016
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy.
[BibTeX]
[DOI]
Joseph Cheriyan
,
Zhihan Gao
,
Konstantinos Georgiou
,
Sahil Singla
Math. Program., 2016

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

2015
Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.
[BibTeX]
[DOI]
Zhihan Gao
PhD thesis, 2015

On the Metric s-t Path Traveling Salesman Problem.
[BibTeX]
[DOI]
Zhihan Gao
SIAM J. Discret. Math., 2015

Approximating Minimum-Cost Connected T-Joins.
[BibTeX]
[DOI]
Joseph Cheriyan
,
Zachary Friggstad
,
Zhihan Gao
Algorithmica, 2015

On Linear Programming Relaxations for Unsplittable Flow in Trees.
[BibTeX]
[DOI]
Zachary Friggstad
,
Zhihan Gao
Proceedings of the Approximation, 2015

2013
An LP-based 32-approximation algorithm for the <i>s</i>-<i>t</i>s-t path graph Traveling Salesman Problem.
[BibTeX]
[DOI]
Zhihan Gao
Oper. Res. Lett., 2013

An LP-based 3/2-approximation algorithm for the graphic s-t path TSP
[BibTeX]
[DOI]
Zhihan Gao
CoRR, 2013


  Loading...