default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhihan Gao 0002
Person information
- affiliation: University of Waterloo, Waterloo, ON, Canada
Other persons with the same name
- Zhihan Gao 0001 — Hong Kong University of Science and Technology (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j7]Joseph Cheriyan, Zhihan Gao:
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP. Algorithmica 80(2): 530-559 (2018)- [j6]Joseph Cheriyan, Zhihan Gao:
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II. Algorithmica 80(2): 608-651 (2018) - [j5]Zhihan Gao:
On the Metric s-t Path Traveling Salesman Problem. SIAM Rev. 60(2): 409-426 (2018) - 2016
- [j4]Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla:
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Math. Program. 159(1-2): 1-29 (2016) - [i7]Joseph Cheriyan, Zhihan Gao:
Approximating (Unweighted) Tree Augmentation via Lift-and-Project (Part 0: $1.8+ε$ approximation for (Unweighted) TAP). CoRR abs/1604.00708 (2016) - 2015
- [b1]Zhihan Gao:
Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. University of Waterloo, Ontario, Canada, 2015 - [j3]Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. Algorithmica 72(1): 126-147 (2015) - [j2]Zhihan Gao:
On the Metric s-t Path Traveling Salesman Problem. SIAM J. Discret. Math. 29(3): 1133-1149 (2015) - [c3]Zachary Friggstad, Zhihan Gao:
On Linear Programming Relaxations for Unsplittable Flow in Trees. APPROX-RANDOM 2015: 265-283 - [i6]Joseph Cheriyan, Zhihan Gao:
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II. CoRR abs/1507.01309 (2015) - [i5]Joseph Cheriyan, Zhihan Gao:
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP. CoRR abs/1508.07504 (2015) - 2014
- [i4]Zhihan Gao:
On the metric s-t path Traveling Salesman Problem. CoRR abs/1404.7569 (2014) - [i3]Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla:
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy. CoRR abs/1405.0945 (2014) - 2013
- [j1]Zhihan Gao:
An LP-based 32-approximation algorithm for the s-ts-t path graph Traveling Salesman Problem. Oper. Res. Lett. 41(6): 615-617 (2013) - [c2]Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla:
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy. ICALP (1) 2013: 340-351 - [i2]Zhihan Gao:
An LP-based 3/2-approximation algorithm for the graphic s-t path TSP. CoRR abs/1304.7055 (2013) - 2012
- [c1]Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. APPROX-RANDOM 2012: 110-121 - [i1]Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. CoRR abs/1207.5722 (2012)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
