Takip et
Yuhao Zhang
Yuhao Zhang
Shanghai Jiao Tong University
sjtu.edu.cn üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
How to match when all vertices arrive online
Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of computing …, 2018
952018
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Z Huang, ZG Tang, X Wu, Y Zhang
ACM Transactions on Algorithms (TALG) 15 (3), 1-15, 2019
822019
Tight competitive ratios of classic matching algorithms in the fully online model
Z Huang, B Peng, ZG Tang, R Tao, X Wu, Y Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
712019
Adwords in a panorama
Z Huang, Q Zhang, Y Zhang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
522020
Fully online matching ii: Beating ranking and water-filling
Z Huang, ZG Tang, X Wu, Y Zhang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
402020
Fully online matching
Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu
Journal of the ACM (JACM) 67 (3), 1-25, 2020
392020
Online selection problems against constrained adversary
Z Jiang, P Lu, ZG Tang, Y Zhang
International Conference on Machine Learning, 5002-5012, 2021
152021
Toward a better understanding of randomized greedy matching
ZG Tang, X Wu, Y Zhang
Journal of the ACM 70 (6), 1-32, 2023
132023
The online food delivery problem on stars
X Guo, K Luo, ZG Tang, Y Zhang
Theoretical Computer Science 928, 13-26, 2022
102022
On the perturbation function of ranking and balance for weighted online bipartite matching
J Liang, ZG Tang, YE Xu, Y Zhang, R Zhou
arXiv preprint arXiv:2210.10370, 2022
62022
Improved bounds for fractional online matching problems
ZG Tang, Y Zhang
Proceedings of the 25th ACM Conference on Economics and Computation, 279-307, 2024
52024
Survivable network design revisited: Group-connectivity
Q Chen, B Laekhanukit, C Liao, Y Zhang
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
52022
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
C Liao, Q Chen, B Laekhanukit, Y Zhang
arXiv preprint arXiv:2202.13088, 2022
32022
Online makespan minimization: The power of restart
Z Huang, N Kang, ZG Tang, X Wu, Y Zhang
21st International Conference on Approximation Algorithms for Combinatorial …, 2018
32018
Algorithms for the Generalized Poset Sorting Problem
SHC Jiang, W Wang, Y Zhang, Y Zhang
arXiv preprint arXiv:2304.01623, 2023
22023
Fair -Center: a Coreset Approach in Low Dimensions
J Gan, M Golin, Z Yang, Y Zhang
arXiv preprint arXiv:2302.09911, 2023
22023
Improved algorithms for online rent minimization problem under unit-size jobs
E Sun, Z Yang, Y Zhang
arXiv preprint arXiv:2306.17241, 2023
12023
Minimizing the Maximum Flow Time in the Online Food Delivery Problem
X Guo, S Li, K Luo, Y Zhang
Algorithmica 86 (4), 907-943, 2024
2024
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs.
YZ Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020
2020
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–19