Yuhao Zhang
张宇昊
Associate Professor
John Hopcroft Center for Computer Science
Shanghai Jiao Tong University
zhang_yuhao [at] sjtu [dot] edu [dot] cn
zhyuhao [at] connect [dot] hku [dot] hk
Short Bio
I am an Associate Professor of John Hopcroft Center for Computer Science at Shanghai Jiao Tong University since 2021, working in the field of theoretical computer science. I obtained my Ph.D. (2016~2020) from the Department of Computer Science at the University of Hong Kong, Supervised by Dr. Zhiyi Huang. Before that, I got my B.E. from the College of Computer Science and Technology at Zhejiang University (2012~2016). During my undergraduate study, I started to be interested in theoretical computer science when I joined the research group of Prof. Guochuan Zhang.
My research focuses on Online Algorithms and Approximation Algorithms. I am dedicated to designing algorithms with provable guarantees for real-world applications and advancing general mathematical frameworks for analyzing their performance.
Preprint
Improved Bounds for Fractional Online Matching Problems.
Joint work with Zhihao Gavin Tang.
Algorithms for the Generalized Poset Sorting Problem.
Joint work with Shaofeng H.-C. Jiang, and Wenqian Wang.
Publications
Bike Rebalancing: How to Find a Balanced Matching in The $k$-center Problem?
News!Joint work with Jinxiang Gan and Guochuan Zhang.
EJOR 2024.Online Food Delivery to Minimize Maximum Flow Time. (full version)
News!Joint work with Xiangyu Guo, Shi Li, and Kelin Luo.
Algorithmica 2023.Towards a Better Understanding of Randomized Greedy Matching. (full version)
News!Joint work with Zhihao Gavin Tang and Xiaowei Wu.
J.ACM 2023 .Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs.
Joint work with Enze Sun and Zonghan Yang.
ESA 2023 .On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching.
Joint work with Jingxun Liang, Zhihao Gavin Tang, Yixuan Xu, and Renfei Zhou.
ESA 2023 .Online Food Delivery to Minimize Maximum Flow Time.
Joint work with Xiangyu Guo, Shi Li, and Kelin Luo.
ISAAC 2022 . (Special Issue to Algorithmica)Survivable Network Design Revisited: Group-Connectivity.
Joint work with Qingyun Chen, Bundit Laekhanukit, and Chao Liao.
FOCS 2022 .The Online Food Delivery Problem on Stars.
Joint work with Xiangyu Guo, Kelin Luo, and Zhihao Gavin Tang.
TCS 2022 .Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity.
Joint work with Chao Liao, Qingyun Chen, and Bundit Laekhanukit.
ICALP 2022 .Online Selection Problems against Constrained Adversary.
Joint work with Zhihao Jiang, Pinyan Lu, and Zhihao Gavin Tang.
ICML 2021 .Fully Online Matching
Joint work with Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, and Xue Zhu.
J.ACM 2020 .Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
Joint work with Chan Chun-Hsiang, Bundit Laekhanukit, and Hao-Ting Wei.
APPROX 2020 .Fully Online Matching II: Beating Ranking and Water-filling
Joint work with Zhiyi Huang, Zhihao Gavin Tang, and Xiaowei Wu.
FOCS 2020 .AdWords in a Panorama
Joint work with Zhiyi Huang and Qiankun Zhang.
FOCS 2020 .Towards a Better Understanding of Randomized Greedy Matching
Joint work with Zhihao Gavin Tang and Xiaowei Wu.
STOC 2020 .Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Joint work with Zhiyi Huang, Zhihao Gavin Tang, and Xiaowei Wu.
TALG 2019 (ICALP 2018) .Tight competitive ratios of classic matching algorithms in the fully online model
Joint work with Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, and Xiaowei Wu.
SODA 2019 .Online Makespan Minimization: The Power of Restart
Joint work with Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, and Xiaowei Wu.
APPROX 2018 .How to Match when All Vertices Arrive Online
Joint work with Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, and Xue Zhu.
STOC 2018 .