Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Nakayoshi, Tomohiro"'
Autor:
Kawase, Yasushi, Nakayoshi, Tomohiro
In this paper, we introduce the problem of Online Matching with Delays and Size-based Costs (OMDSC). The OMDSC problem involves $m$ requests arriving online. At any time, a group can be formed by matching any number of these requests that have been r
Externí odkaz:
http://arxiv.org/abs/2408.08658
Autor:
Kakimura, Naonori, Nakayoshi, Tomohiro
In this paper, we study the Min-cost Perfect $k$-way Matching with Delays ($k$-MPMD), recently introduced by Melnyk et al. In the problem, $m$ requests arrive one-by-one over time in a metric space. At any time, we can irrevocably make a group of $k$
Externí odkaz:
http://arxiv.org/abs/2310.18071