3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.NT2024
On further questions regarding unit fractions
Yang P. Liu, Mehtaab Sawhney
We prove that a subset with \[\sum_{n\in A}\frac{1}{n} \ge (\log N)^{4/5 + o(1)}\] contains a subset such that \[\sum_{n\in B} \frac{1}{n} = 1.\] Our techni…
cs.DS2023
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time
Jan van den Brand, Li Chen, Rasmus Kyng +5
We provide an algorithm which, with high probability, maintains a -approximate maximum flow on an undirected graph undergoing -edge additions in amortized $m^{o(1)} ε^{-3…
cs.DS2023★ 3 cited
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
Jan van den Brand, Li Chen, Rasmus Kyng +5
We give a deterministic time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with edges and polynomially bounded integral dem…