BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250429T163000
DTEND;TZID=Asia/Seoul:20250429T173000
DTSTAMP:20260417T000234
CREATED:20250212T111256Z
LAST-MODIFIED:20250212T112909Z
UID:10581-1745944200-1745947800@dimag.ibs.re.kr
SUMMARY:Eunjin Oh (오은진)\, Approximation Algorithms for the Geometric Multimatching Problem
DESCRIPTION: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 points in T as its assigned value\, and vice versa for each point in T. The cost of a multimatching is defined as the sum of the distances between all matched pairs of points. The geometric multimatching problem seeks to find a multimatching that minimizes this cost. A special case where each point is matched to at most one other point is known as the geometric many-to-many matching problem. \nWe present two results for these problems when the underlying metric space has a bounded doubling dimension. Specifically\, we provide the first near-linear-time approximation scheme for the geometric multimatching problem in terms of the output size. Additionally\, we improve upon the best-known approximation algorithm for the geometric many-to-many matching problem\, previously introduced by Bandyapadhyay and Xue (SoCG 2024)\, which won the best paper award at SoCG 2024. \nThis is joint work with Shinwoo An and Jie Xue.
URL:https://dimag.ibs.re.kr/event/2025-04-29/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR