default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuhao Zhang 0001
Person information
- affiliation: Shanghai Jiao Tong University, China
- affiliation (former): University of Hong Kong, Department of Computer Science
Other persons with the same name
- Yuhao Zhang (aka: Yu-Hao Zhang) — disambiguation page
- Yuhao Zhang 0002
![[0000-0002-8848-5924]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-8848-5924")
— Beijing University of Posts and Telecommunications, School of Information and Communication Engineering, China - Yu-Hao Zhang 0003 (aka: Yuhao Zhang 0003) — Henan University, School of Business, Kaifeng, China
- Yuhao Zhang 0004 — Stanford University, CA, USA
- Yuhao Zhang 0005 — University of Wisconsin-Madison, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. Algorithmica 86(4): 907-943 (2024)- [j5]Zhiyi Huang, Qiankun Zhang, Yuhao Zhang:
AdWords in a Panorama. SIAM J. Comput. 53(3): 701-763 (2024) - [c15]Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang:
Algorithms for the Generalized Poset Sorting Problem. ICALP 2024: 92:1-92:15 - 2023
- [j4]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Toward a Better Understanding of Randomized Greedy Matching. J. ACM 70(6): 39:1-39:32 (2023) - [c14]Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou:
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. ESA 2023: 80:1-80:15 - [c13]Enze Sun, Zonghan Yang, Yuhao Zhang:
Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs. ESA 2023: 97:1-97:14 - [i17]Jinxiang Gan, Mordecai J. Golin, Zonghan Yang, Yuhao Zhang:
Fair k-Center: a Coreset Approach in Low Dimensions. CoRR abs/2302.09911 (2023) - [i16]Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang:
Algorithms for the Generalized Poset Sorting Problem. CoRR abs/2304.01623 (2023) - [i15]Enze Sun, Zonghan Yang, Yuhao Zhang:
Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs. CoRR abs/2306.17241 (2023) - 2022
- [j3]Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang:
The online food delivery problem on stars. Theor. Comput. Sci. 928: 13-26 (2022) - [c12]Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang:
Survivable Network Design Revisited: Group-Connectivity. FOCS 2022: 278-289 - [c11]Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang:
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. ICALP 2022: 89:1-89:17 - [c10]Xiangyu Guo, Kelin Luo, Shi Li, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. ISAAC 2022: 33:1-33:18 - [i14]Zhihao Gavin Tang, Yuhao Zhang:
Improved Bounds for Fractional Online Matching Problems. CoRR abs/2202.02948 (2022) - [i13]Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang:
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. CoRR abs/2202.13088 (2022) - [i12]Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang:
Survivable Network Design Revisited: Group-Connectivity. CoRR abs/2204.13648 (2022) - [i11]Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou:
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. CoRR abs/2210.10370 (2022) - 2021
- [c9]Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang:
Online Selection Problems against Constrained Adversary. ICML 2021: 5002-5012 - [i10]Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Online Food Delivery to Minimize Maximum Flow Time. CoRR abs/2110.15772 (2021) - 2020
- [j2]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu:
Fully Online Matching. J. ACM 67(3): 17:1-17:25 (2020) - [c8]Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang:
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. APPROX-RANDOM 2020: 63:1-63:20 - [c7]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Fully Online Matching II: Beating Ranking and Water-filling. FOCS 2020: 1380-1391 - [c6]Zhiyi Huang, Qiankun Zhang, Yuhao Zhang:
AdWords in a Panorama. FOCS 2020: 1416-1426 - [c5]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Towards a better understanding of randomized greedy matching. STOC 2020: 1097-1110 - [i9]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
A Simple 1-1/e Approximation for Oblivious Bipartite Matching. CoRR abs/2002.06037 (2020) - [i8]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Fully Online Matching II: Beating Ranking and Water-filling. CoRR abs/2005.06311 (2020) - [i7]Zhiyi Huang, Qiankun Zhang, Yuhao Zhang:
Adwords in a Panorama. CoRR abs/2009.04114 (2020)
2010 – 2019
- 2019
- [j1]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. ACM Trans. Algorithms 15(3): 38:1-38:15 (2019) - [c4]Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang:
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. SODA 2019: 2875-2886 - [i6]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Perturbed Greedy on Oblivious Matching Problems. CoRR abs/1907.05135 (2019) - [i5]Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang:
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. CoRR abs/1911.09150 (2019) - 2018
- [c3]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Makespan Minimization: The Power of Restart. APPROX-RANDOM 2018: 14:1-14:19 - [c2]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. ICALP 2018: 79:1-79:14 - [c1]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu:
How to match when all vertices arrive online. STOC 2018: 17-29 - [i4]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu:
How to Match when All Vertices Arrive Online. CoRR abs/1802.03905 (2018) - [i3]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. CoRR abs/1804.07458 (2018) - [i2]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Makespan Minimization: The Power of Restart. CoRR abs/1806.02207 (2018) - [i1]Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang:
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. CoRR abs/1810.07903 (2018)
Coauthor Index
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-11-04 20:44 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:
