3 citations · 13 across the 18 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Simpler Analyses of Union-Find
Zhiyi Huang, Chris Lambert, Zipei Nie +1
We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the , , , and $O(α(n))…
cs.DS2023
Euclidean Capacitated Vehicle Routing in Random Setting: A -Approximation Algorithm
Zipei Nie, Hang Zhou
We study the unit-demand capacitated vehicle routing problem in the random setting of the Euclidean plane. The objective is to visit random terminals in a square using a set of…
cs.DS2021★ 2 cited
Improved Online Correlated Selection
Ruiquan Gao, Zhongtian He, Zhiyi Huang +3
This paper studies the online correlated selection (OCS) problem. It was introduced by Fahrbach, Huang, Tao, and Zadimoghaddam (2020) to obtain the first edge-weighted online bipar…