Obserwuj
Yuhao Zhang
Tytuł
Cytowane przez
Cytowane przez
Rok
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
812018
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
592019
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
552019
Adwords in a panorama
Z Huang, Q Zhang, Y Zhang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
292020
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
242020
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
222020
Towards a better understanding of randomized greedy matching
ZG Tang, X Wu, Y Zhang
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
122020
Online selection problems against constrained adversary
Z Jiang, P Lu, ZG Tang, Y Zhang
International Conference on Machine Learning, 5002-5012, 2021
42021
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
22018
The online food delivery problem on stars
X Guo, K Luo, ZG Tang, Y Zhang
Theoretical Computer Science 928, 13-26, 2022
12022
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
12022
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
2022
Improved Bounds for Fractional Online Matching Problems
ZG Tang, Y Zhang
arXiv preprint arXiv:2202.02948, 2022
2022
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
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–14