On the number ofk-cycles in the assignment problem for random matrices

DOI10.1088/1742-5468/2008/03/P03019zbMath1456.82498OpenAlexW3098760203MaRDI QIDQ5239474

Fernando Falceto, José G. Esteve

Publication date: 22 October 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1742-5468/2008/03/p03019

zbMATH Keywords

networksrandom graphstypical-case computational complexity

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Matching theory
• A proof of Parisi's conjecture on the random assignment problem
• The ?(2) limit in the random assignment problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Exact solution of the random bipartite matching model
• The Traveling Salesman Problem with Distances One and Two
• On Random Symmetric Travelling Salesman Problems

This page was built for publication: On the number ofk-cycles in the assignment problem for random matrices