On random multi-dimensional assignment problems

From MaRDI portal
Publication:2004066

DOI10.1016/J.DAM.2020.07.013zbMATH Open1460.60115arXiv1901.07167OpenAlexW3046250074MaRDI QIDQ2004066FDOQ2004066

Wesley Pegden, Tomasz Tkocz, Alan Frieze

Publication date: 14 October 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: 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 Wi,j,k satisfy Wi,j,k=ai,j+bi,k+cj,k where the ai,j,bi,k,cj,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 Wi,j,k are independent exponential rate 1 random variables. Here all that is known is an no(1)-approximation, due to Frieze and Sorkin.


Full work available at URL: https://arxiv.org/abs/1901.07167





Cites Work


Cited In (6)






This page was built for publication: On random multi-dimensional assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004066)