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
90C35: Programming involving graphs or networks
05C80: Random graphs (graph-theoretic aspects)
90C27: Combinatorial optimization
60C05: Combinatorial probability
Related Items
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, The Effect of Adding Randomly Weighted Edges, Efficient algorithms for three‐dimensional axial and planar random assignment problems, On the Length of a Random Minimum Spanning Tree, Unnamed Item, On the Maximum of a Special Random Assignment Process, Successive minimum spanning trees, The planted matching problem: sharp threshold and infinite-order phase transition, Replica symmetry of the minimum matching, The planted matching problem: phase transitions and exact results, Typical values of extremal-weight combinatorial structures with independent symmetric weights, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs, On the longest path of a randomly weighted tournament, On the maximum of random assignment process, Minimum Cost Matching in a Random Graph with Random Costs, The Blind Passenger and the Assignment Problem, Successive shortest paths in complete graphs with random edge weights
