凹时滞最小费用匹配问题
The Min-Cost Matching with Concave Delays Problem
摘要:
研究了凹时滞在线最小费用完美匹配问题。我们从单一位置变量开始。具体而言,请求以在线方式到达单一位置。然后,算法必须在匹配一对请求或延迟它们以稍后匹配之间进行选择。成本由延迟的凹函数定义。给定线性或甚至凸延迟函数,匹配任何两个可用的请求是平凡最优的。然而,这并不延伸到凹延迟。我们解决了这个问题,通过提供一个$O(1)$竞争的算法,是通过一系列的延迟计数器定义。此后,我们考虑的问题给出了一个潜在的$n$点度量。然后,匹配的成本被定义为连接成本(由度量定义)加上延迟成本。给定线性延迟,这个问题由Emek等人提出,并被称为线性延迟最小成本完美匹配(MPMD)问题。Liu等人考虑了凸时滞,随后提出了在凹时滞下是否存在具有小竞争比的解。我们证明这是真的,通过扩展我们的单位置算法和证明$O(\log n)$的竞争力。最后,我们把我们的重点放在双色的情况下,其中的请求有极性,只有相反的极性可以匹配。我们将展示如何改变我们以前的算法,再次实现$O(1)$和$O(\log n)$竞争力的单一位置和度量的情况下。
英文摘要:
We consider the problem of online min-cost perfect matching with concave delays. We begin with the single location variant. Specifically, requests arrive in an online fashion at a single location. The algorithm must then choose between matching a pair of requests or delaying them to be matched later on. The cost is defined by a concave function on the delay. Given linear or even convex delay functions, matching any two available requests is trivially optimal. However, this does not extend to concave delays. We solve this by providing an $O(1)$-competitive algorithm that is defined through a series of delay counters. Thereafter we consider the problem given an underlying $n$-points metric. The cost of a matching is then defined as the connection cost (as defined by the metric) plus the delay cost. Given linear delays, this problem was introduced by Emek et al. and dubbed the Min-cost perfect matching with linear delays (MPMD) problem. Liu et al. considered convex delays and subsequently asked whether there exists a solution with small competitive ratio given concave delays. We show this to be true by extending our single location algorithm and proving $O(\log n)$ competitiveness. Finally, we turn our focus to the bichromatic case, wherein requests have polarities and only opposite polarities may be matched. We show how to alter our former algorithms to again achieve $O(1)$ and $O(\log n)$ competitiveness for the single location and for the metric case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。