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.DS2025
Structural Parameterization of Steiner Tree Packing
Niko Hastrich, Kirill Simonov
Steiner Tree Packing (STP) is a notoriously hard problem in classical complexity theory, which is of practical relevance to VLSI circuit design. Previous research has approached th…