Efficient algorithms for three‐dimensional axial and planar random assignment problems

Beautiful formulas are known for the expected cost of random two‐dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural “Axial” and “Planar” versions, both of which are NP‐hard. For 3‐dimensional Axial random assignment instances of size n, the cost scales as Ω(1/ n), and a main result of the present paper is a linear‐time algorithm that, with high probability, finds a solution of cost O(n–1+o(1)). For 3‐dimensional Planar assignment, the lower bound is Ω(n), and we give a new efficient matching‐based algorithm that with high probability returns a solution with cost O(n log n). © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 160–196, 2015

[1]  Stefanie Gerke,et al.  Nonvertex‐Balanced Factors in Random Graphs , 2013, J. Graph Theory.

[2]  Johan Wästlund.  An easy proof of the $\zeta(2)$ limit in the random assignment problem , 2009 .

[3]  S. A. Dichkovskaya,et al.  Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem , 2007 .

[4]  Panos M. Pardalos,et al.  Asymptotic behavior of the expected optimal value of the multidimensional assignment problem , 2007, Math. Program..

[5]  Alex D. Scott,et al.  Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function , 2006, TALG.

[6]  B. Prabhakar,et al.  Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures , 2005 .

[7]  V. Kravtsov,et al.  Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem , 2005 .

[8]  M. Mézard,et al.  Random multi-index matching problems , 2005, cond-mat/0507180.

[9]  Panos M. Pardalos,et al.  Asymptotic Results for Random Multidimensional Assignment Problems , 2005, Comput. Optim. Appl..

[10]  M. Mézard,et al.  Frozen glass phase in the multi-index matching problem. , 2004, Physical review letters.

[11]  Svante Linusson,et al.  A proof of Parisi’s conjecture on the random assignment problem , 2003, math/0303214.

[12]  D. P. Robbins,et al.  On the expected value of the minimum assignment , 2000, Random Struct. Algorithms.

[13]  D. Coppersmith,et al.  Constructive bounds and exact expectation for the random assignment problem , 1999 .

[14]  Don Coppersmith,et al.  Constructive bounds and exact expectations for the random assignment problem , 1998, Random Struct. Algorithms.

[15]  G. Parisi.  A Conjecture on random bipartite matching , 1998, cond-mat/9801176.

[16]  D. Aldous.  Asymptotics in the random assignment problem , 1992 .

[17]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[18]  Martin E. Dyer,et al.  On linear programs with random costs , 1986, Math. Program..

[19]  M. Mézard,et al.  Replicas and optimization , 1985 .

[20]  Jeanette P. Schmidt,et al.  Component structure in the evolution of random hypergraphs , 1985, Comb..

[21]  A. Frieze.  Complexity of a 3-dimensional assignment problem , 1983 .

[22]  E. Upfal,et al.  On factors in random graphs , 1981 .

[23]  Alan Frieze,et al.  An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice , 1981 .

[24]  Alan M. Frieze,et al.  A bilinear programming formulation of the 3-dimensional assignment problem , 1974, Math. Program..

[25]  W. Donath.  Algorithm and average-value bounds for assignment problems , 1969 .

[26]  採編典藏組.  Society for Industrial and Applied Mathematics(SIAM) , 2008 .

[27]  Johan Wästlund.  AN EASY PROOF OF THE ζ ( 2 ) LIMIT IN THE RANDOM ASSIGNMENT PROBLEM , 2006 .

[28]  Johan Wästlund.  A simple proof of the Parisi and Coppersmith-Sorkin formulas for the random assignment problem , 2005 .

[29]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[30]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[31]  Alan M. Frieze,et al.  On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[32]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[33]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .