Yuhao Zhang

Orcid: 0000-0001-9330-1926

Affiliations:
  • Shanghai Jiao Tong University, China
  • University of Hong Kong, Department of Computer Science (former)


According to our database1, Yuhao Zhang authored at least 24 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Minimizing the Maximum Flow Time in the Online Food Delivery Problem.
Algorithmica, April, 2024

2023
Toward a Better Understanding of Randomized Greedy Matching.
J. ACM, December, 2023

Algorithms for the Generalized Poset Sorting Problem.
CoRR, 2023

Fair k-Center: a Coreset Approach in Low Dimensions.
CoRR, 2023

Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
The online food delivery problem on stars.
Theor. Comput. Sci., 2022

Improved Bounds for Fractional Online Matching Problems.
CoRR, 2022

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Survivable Network Design Revisited: Group-Connectivity.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Online Food Delivery to Minimize Maximum Flow Time.
CoRR, 2021

Online Selection Problems against Constrained Adversary.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Fully Online Matching.
J. ACM, 2020

A Simple 1-1/e Approximation for Oblivious Bipartite Matching.
CoRR, 2020

Towards a better understanding of randomized greedy matching.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

AdWords in a Panorama.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Fully Online Matching II: Beating Ranking and Water-filling.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs.
Proceedings of the Approximation, 2020

2019
Online Vertex-Weighted Bipartite Matching: Beating 1-1/<i>e</i> with Random Arrivals.
ACM Trans. Algorithms, 2019

Perturbed Greedy on Oblivious Matching Problems.
CoRR, 2019

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
How to match when all vertices arrive online.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Online Makespan Minimization: The Power of Restart.
Proceedings of the Approximation, 2018


  Loading...