2 papers
cs.CG2026
Computing All Optimal Partial -Wasserstein Matchings on the Line
Sebastian Angrick, Jacobus Conradi, Mónika Csikós +5
For , the -Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p…
cs.DS2022
Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical
Mónika Csikós, Nabil H. Mustafa
We study one of the key tools in data approximation and optimization: low-discrepancy colorings. Formally, given a finite set system , the \emph{discrepancy} of a t…