An easy proof of the \(\zeta (2)\) limit in the random assignment problem
From MaRDI portal
Publication:1038962
DOI10.1214/ECP.v14-1475zbMath1195.60018MaRDI QIDQ1038962
Publication date: 20 November 2009
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/229533
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Combinatorial probability (60C05)
Related Items (19)
On the Maximum of a Special Random Assignment Process ⋮ On the longest path of a randomly weighted tournament ⋮ On the maximum of random assignment process ⋮ Successive minimum spanning trees ⋮ The planted matching problem: sharp threshold and infinite-order phase transition ⋮ Unnamed Item ⋮ Extrema of a multinomial assignment process ⋮ On the Length of a Random Minimum Spanning Tree ⋮ Replica symmetry of the minimum matching ⋮ Minimum Cost Matching in a Random Graph with Random Costs ⋮ The Blind Passenger and the Assignment Problem ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph ⋮ Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs ⋮ Efficient algorithms for three‐dimensional axial and planar random assignment problems ⋮ Successive shortest paths in complete graphs with random edge weights ⋮ The planted matching problem: phase transitions and exact results ⋮ The Effect of Adding Randomly Weighted Edges ⋮ Typical values of extremal-weight combinatorial structures with independent symmetric weights
This page was built for publication: An easy proof of the \(\zeta (2)\) limit in the random assignment problem
