4 papers
A Faster Algorithm for Constrained Correlation Clustering
Nick Fischer, Evangelos Kipouridis, Jonas Klausen +1
In the Correlation Clustering problem we are given nodes, and a preference for each pair of nodes indicating whether we prefer the two endpoints to be in the same cluster or no…
Hashing for Sampling-Based Estimation
Anders Aamand, Ioana O. Bercea, Jakob Bæk Tejs Houen +2
Hash-based sampling and estimation are common themes in computing. Using hashing for sampling gives us the coordination needed to compare samples from different sets. Hashing is al…
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…
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…