Eunjin Oh (오은진), Approximation Algorithms for the Geometric Multimatching Problem
Room B332 IBS (기초과학연구원)Let S and T be two sets of points in a metric space with a total of n points. Each point in S and T has an associated value that specifies an upper limit on how many points it can be matched with from the other set. A multimatching between S and T is a way of pairing points such that each point in S is matched with at least as many …