2 citations · 5 across the 12 of their papers we have counts for
4 papers · 1 filter
Petal diagram from simple braids
Zipei Nie
We construct petal diagrams from simple braids. This approach allows us to confirm a conjecture proposed by Kim, No and Yoo, which states that the petal number of the nontrivial to…
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))…
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…
On a conjecture of Knuth about forward and back arcs
Zipei Nie
Following Janson's method, we prove a conjecture of Knuth: the numbers of forward and back arcs for the depth-first search (DFS) in a digraph with a geometric outdegree distributio…