Fully Online Matching
11 041
204.5
Microsoft Research330 тыс
Следующее
13.09.18 – 3 78253:54Популярные
244 дня – 6754:47
Опубликовано 13 сентября 2018, 20:29
We introduce a fully online model of maximum cardinality matching in which all vertices arrive online. On the arrival of a vertex, its incident edges to previously-arrived vertices are revealed. Each vertex has a deadline that is after all its neighbors' arrivals. If a vertex remains unmatched until its deadline, the algorithm must then irrevocably either match it to an unmatched neighbor, or leave it unmatched. The model generalizes the existing one-sided online model and is motivated by applications including ride-sharing platforms, real-estate agency, etc.
See more at microsoft.com/en-us/research/v...
See more at microsoft.com/en-us/research/v...
Свежие видео
18 часов – 29 9501:16
7 дней – 4 7471:43
7 дней – 1 1821:20
7 дней – 5110:23
12 дней – 6 5270:15Случайные видео
148 дней – 1 5582:14
178 дней – 10 0070:18
320 дней – 18 7982:45
27.05.23 – 34 8595:14
25.05.23 – 15 6840:16
12.08.22 – 5 8671:00
1 день – 1 4910:56
1 день – 831:58
8 дней – 1452:24
12 дней – 4372:05
12 дней – 2 066 76231:26
13 дней – 16 2817:44
13 часов – 4030:42