关于随机多维指派问题
On random multi-dimensional assignment problems
摘要:
我们研究随机多维指派问题,其中成本分解为独立随机变量之和。特别地,在三维中,我们假设成本$W_{i,j,k}$满足$W_{i,j,k}=a_{i,j}+b_{i,k}+c_{j,k}$,其中$a_{i,j},b_{i,k},c_{j,k}$是独立的指数率1随机变量。我们的目标是最小化总成本,我们表明,w. h. p.一个简单的贪婪算法是一个$(3+o(1))$ -近似。这与其中$W_{i,j,k}$是独立指数率1随机变量的情况相反。在这里,所有已知的是一个$n^{o(1)}$ -近似,由于弗里兹和索尔金。
英文摘要:
We study random multidimensional assignment problems where the costs decompose into the sum of independent random variables. In particular, in three dimensions, we assume that the costs $W_{i,j,k}$ satisfy $W_{i,j,k}=a_{i,j}+b_{i,k}+c_{j,k}$ where the $a_{i,j},b_{i,k},c_{j,k}$ are independent exponential rate 1 random variables. Our objective is to minimize the total cost and we show that w.h.p. a simple greedy algorithm is a $(3+o(1))$-approximation. This is in contrast to the case where the $W_{i,j,k}$ are independent exponential rate 1 random variables. Here all that is known is an $n^{o(1)}$-approximation, due to Frieze and Sorkin.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。