arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.06640cs.DS
收藏

带时滞的在线k路匹配与H度量

Online k-Way Matching with Delays and the H-Metric

Darya Melnyk, Yuyi Wang, Roger Wattenhofer

摘要:

本文研究了带时延的$k$ -路最小代价完美匹配问题--$k$ -MPMD问题。这个问题考虑一个度量空间与$n$节点。请求以联机方式到达这些节点。任务是将这些请求匹配到精确的$k$集合中,以便最小化所有匹配请求的空间和时间成本。空间成本的概念需要定义一个底层度量空间,该度量空间给出$k$元素子集的距离。对于$k>2$,找到一个合适的度量空间的任务是在我们的问题的核心:我们表明,对于一些已知的推广到$k=3$点,如$2$ -度量和$D$ -度量,有没有竞争力的随机算法的$3$ -MPMD问题。$G$ -度量定义为3个点,并允许$3$ -MPMD问题的竞争算法。对于$k>3$点,存在$G$ -度量的两种概括,称为$n$ -度量和$K$ -度量。我们表明,无论是$n$度量,也没有$K$度量可以用于$k$ -MPMD问题。在积极的一面,我们引入了$H$ -度量,第一个度量,以允许一个解决方案的$k$ -MPMD问题的所有$k$。为了设计基于$H$ -度量的$k$-MPMD问题的在线算法,我们将$H$ -度量嵌入到具有$O(\log n)$失真的树中.基于此嵌入结果,我们扩展了Azar等人提出的算法。(2017)并实现了$k$ -MPMD问题的竞争比$O(\log n)$。

英文摘要:

In this paper, we study $k$-Way Min-cost Perfect Matching with Delays - the $k$-MPMD problem. This problem considers a metric space with $n$ nodes. Requests arrive at these nodes in an online fashion. The task is to match these requests into sets of exactly $k$, such that the space and time cost of all matched requests are minimized. The notion of the space cost requires a definition of an underlying metric space that gives distances of subsets of $k$ elements. For $k>2$, the task of finding a suitable metric space is at the core of our problem: We show that for some known generalizations to $k=3$ points, such as the $2$-metric and the $D$-metric, there exists no competitive randomized algorithm for the $3$-MPMD problem. The $G$-metrics are defined for 3 points and allows for a competitive algorithm for the $3$-MPMD problem. For $k>3$ points, there exist two generalizations of the $G$-metrics known as $n$- and $K$-metrics. We show that neither the $n$-metrics nor the $K$-metrics can be used for the $k$-MPMD problem. On the positive side, we introduce the $H$-metrics, the first metrics to allow for a solution of the $k$-MPMD problem for all $k$. In order to devise an online algorithm for the $k$-MPMD problem on the $H$-metrics, we embed the $H$-metric into trees with an $O(\log n)$ distortion. Based on this embedding result, we extend the algorithm proposed by Azar et al. (2017) and achieve a competitive ratio of $O(\log n)$ for the $k$-MPMD problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑