Fully Online Matching
11 049
204.6
Microsoft Research334 тыс
Следующее
13.09.18 – 3 83953:54Популярные
26.09.23 – 2 0311:18
Опубликовано 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...
Свежие видео
4 дня – 70 36524:16
4 дня – 1 6160:16
4 дня – 37 86114:57
7 дней – 1 800 11520:41
9 дней – 44711:06
10 дней – 2 25310:41Случайные видео
351 день – 12 1674:49:57
08.11.23 – 5919:56
12.09.23 – 159 0741:22
12.06.23 – 241 3101:30
06.08.22 – 13 56022:36
04.10.15 – 39 03355:11
2 дня – 2373:53
4 дня – 1 0960:56
4 дня – 1 1274:01
5 дней – 43 4767:00
12 дней – 6990:30
12 дней – 56516:42
12 дней – 33 44311:38
3 дня – 554 7240:59