Pages that link to "Item:Q2746215"
From MaRDI portal
The following pages link to The \(\zeta(2)\) limit in the random assignment problem (Q2746215):
Displaying 26 items.
- Random Simplicial Complexes: Around the Phase Transition (Q4604389) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph (Q4643315) (← links)
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment (Q4667865) (← links)
- Branching Process Approach for 2-Sat Thresholds (Q4933200) (← links)
- The random fractional matching problem (Q4964595) (← links)
- Random multi-index matching problems (Q4968882) (← links)
- The Effect of Adding Randomly Weighted Edges (Q4992839) (← links)
- The minimum perfect matching in pseudo-dimension 0 < <i>q</i> < 1 (Q4993130) (← links)
- The Random QUBO (Q5050147) (← links)
- Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities (Q5060507) (← links)
- Aligning random graphs with a sub-tree similarity message-passing algorithm (Q5093855) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- The number of matchings in random graphs (Q5239288) (← links)
- On the number of<i>k</i>-cycles in the assignment problem for random matrices (Q5239474) (← links)
- Diameter of the Stochastic Mean-Field Model of Distance (Q5373829) (← links)
- Scaling and universality in continuous length combinatorial optimization (Q5460806) (← links)
- Minimum weight disk triangulations and fillings (Q5857742) (← links)
- The Dyck bound in the concave 1-dimensional random assignment model (Q5870421) (← links)
- On the Maximum of a Special Random Assignment Process (Q5883338) (← links)
- The planted matching problem: sharp threshold and infinite-order phase transition (Q6095833) (← links)
- Heavy and light paths and Hamilton cycles (Q6161457) (← links)
- The cost of strategy-proofness in school choice (Q6176756) (← links)
- Extrema of a multinomial assignment process (Q6198968) (← links)
- The Erlang weighted tree, a new branching process (Q6201034) (← links)
- Quick or cheap? Breaking points in dynamic markets (Q6559466) (← links)
