3 citations · 3 across the 5 of their papers we have counts for
4 papers · 1 filter
Online sorting and online TSP: randomized, stochastic, and high-dimensional
Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta +2
In the online sorting problem, items are revealed one by one and have to be placed (immediately and irrevocably) into empty cells of a size- array. The goal is to minimize t…
Approximate Earth Mover's Distance in Truly-Subquadratic Time
Lorenzo Beretta, Aviad Rubinstein
We design an additive approximation scheme for estimating the cost of the min-weight bipartite matching problem: given a bipartite graph with non-negative edge costs and $\varepsil…
Locally Uniform Hashing
Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen +2
Hashing is a common technique used in data processing, with a strong impact on the time and resources spent on computation. Hashing also affects the applicability of theoretical re…
Better Sum Estimation via Weighted Sampling
Lorenzo Beretta, Jakub Tětek
Given a large set where each item has weight , we want to estimate the total weight to within factor of with some consta…