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

随机匹配的改进近似算法

Improved Approximation Algorithms for Stochastic Matching

Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee

摘要:

在本文中,我们考虑随机匹配问题,这是出于肾脏交换和在线约会的应用。我们给出一个无向图,其中每个边都被分配了存在概率和正利润,每个节点都被分配了一个称为超时的正整数。只有在探测到边之后,我们才知道边是否存在。在这个随机图上,我们正在执行一个过程,一个接一个地探测边,并逐渐构建匹配。该过程以两种方式受到约束:一旦获取了边,就不能将其从匹配中移除,并且节点$v$的超时上限了可以探测的与$v$关联的边的数量。我们的目标是最大化所构造的匹配的期望利润。对于这个问题,Bansal等人(Micromica 2012)提供了二分图的$3$ -近似算法,以及一般图的$4$ -近似算法。在这项工作中,我们改进的逼近因子$2.845$和$3.709$,分别。我们还考虑了一个在线版本的二分的情况下,其中一方的分区到达节点的节点,每一次节点$b$到达,我们必须决定哪些边缘事件到$b$,我们要探测,并以何种顺序。在这里,我们提出了一个$4.07$ -近似,改进的$7.92$ -近似Bansal等人。在我们的结果中的主要技术成分是一种新的方式探测边缘根据一个随机的,但不均匀的排列。用一个最适合大概率边缘的算法(加上一些额外的想法)修补这个方法,可以得到我们改进的近似因子。

英文摘要:

In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of existence and a positive profit, and each node is assigned a positive integer called timeout. We know whether an edge exists or not only after probing it. On this random graph we are executing a process, which one-by-one probes the edges and gradually constructs a matching. The process is constrained in two ways: once an edge is taken it cannot be removed from the matching, and the timeout of node $v$ upper-bounds the number of edges incident to $v$ that can be probed. The goal is to maximize the expected profit of the constructed matching. For this problem Bansal et al. (Algorithmica 2012) provided a $3$-approximation algorithm for bipartite graphs, and a $4$-approximation for general graphs. In this work we improve the approximation factors to $2.845$ and $3.709$, respectively. We also consider an online version of the bipartite case, where one side of the partition arrives node by node, and each time a node $b$ arrives we have to decide which edges incident to $b$ we want to probe, and in which order. Here we present a $4.07$-approximation, improving on the $7.92$-approximation of Bansal et al. The main technical ingredient in our result is a novel way of probing edges according to a random but non-uniform permutation. Patching this method with an algorithm that works best for large probability edges (plus some additional ideas) leads to our improved approximation factors.

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

↑