2 papers
cs.CG2026
Approximation Algorithm for the Min-Cost Bipartite Matching with Penalties
Eunjin Oh, Seongbin Park, Chanho Song
In this paper, we study the minimum-cost bipartite matching with penalties problem in metric spaces with bounded doubling dimension: Given two disjoint sets in a metric spac…
cs.CG2026
Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
Seongbin Park, Eunjin Oh
In this paper, we study the many-to-many matching problem on planar point sets with integer coordinates: Given two disjoint sets with , the goal is t…