Computing All Optimal Partial $p$-Wasserstein Matchings on the Line
An FFT-based data structure for balanced-interval transport queries is provided and an open-source C++ implementation is provided that outperforms the state-of-the-art baseline on a range of synthetic instances and establishes a conditional lower bound for p=\infty.