On random multi-dimensional assignment problems
On random multi-dimensional assignment problems
复制标题
关于随机多维分配问题
DOI:
10.1016/j.dam.2020.07.013
复制
发表时间:
2020
影响因子:
1.1
通讯作者:
Tkocz, Tomasz
中科院分区:
文献类型:
--
作者:
Frieze, Alan;Pegden, Wesley;Tkocz, Tomasz
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 uniform [0, 1] random variables. Our objective is to minimise the total cost and we show that whp 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.
登录
查看更多内容
DOI:
--
发表时间:
2005
期刊:
影响因子:
--
作者:
V. M. Kravtsov
通讯作者:
V. M. Kravtsov
影响因子:
2
作者:
Svante Linusson;Johan Wästlund
通讯作者:
Johan Wästlund
影响因子:
1
作者:
Chandra Nair;B. Prabhakar;Mayank Sharma
通讯作者:
Mayank Sharma
DOI:
--
发表时间:
2010
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
A. Frieze;G. Sorkin
通讯作者:
G. Sorkin