Pages that link to "Item:Q1038962"
From MaRDI portal
The following pages link to An easy proof of the \(\zeta (2)\) limit in the random assignment problem (Q1038962):
Displayed 18 items.
- Replica symmetry of the minimum matching (Q431636) (← links)
- The planted matching problem: phase transitions and exact results (Q2075325) (← links)
- Typical values of extremal-weight combinatorial structures with independent symmetric weights (Q2111788) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs (Q2240864) (← links)
- On the longest path of a randomly weighted tournament (Q2399297) (← links)
- On the maximum of random assignment process (Q2670804) (← links)
- Minimum Cost Matching in a Random Graph with Random Costs (Q2968521) (← links)
- The Blind Passenger and the Assignment Problem (Q2998855) (← links)
- Successive shortest paths in complete graphs with random edge weights (Q3386534) (← links)
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph (Q4643315) (← links)
- The Effect of Adding Randomly Weighted Edges (Q4992839) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- On the Length of a Random Minimum Spanning Tree (Q5364266) (← links)
- (Q5875520) (← links)
- On the Maximum of a Special Random Assignment Process (Q5883338) (← links)
- Successive minimum spanning trees (Q6074707) (← links)
- The planted matching problem: sharp threshold and infinite-order phase transition (Q6095833) (← links)