BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20220701T120000Z
UID:813c46135406f4d06957d7770e0ace72-302
DTSTAMP:19700101T120011Z
DESCRIPTION:Online Algorithm for the Minimum Metric Bipartite Matching Problem
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/302/online-algorithm-for-the-minimum-metric-bipartite-matching-problem/
SUMMARY:In the online minimum-metric bipartite matching (OMBM) problem, we are given a set S of server locations. The locations of requests (given by the set R) are revealed one at a time and when a request is revealed, we must immediately and irrevocably match it to a free
DTSTART:20220701T120000Z
END:VEVENT
END:VCALENDAR