Efficient algorithms for three‐dimensional axial and planar random assignment problems
From MaRDI portal
Publication:5175234
DOI10.1002/rsa.20525zbMath1347.60141arXiv1008.0390OpenAlexW2964270660WikidataQ57401410 ScholiaQ57401410MaRDI QIDQ5175234
Gregory B. Sorkin, Alan M. Frieze
Publication date: 20 February 2015
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.0390
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Perfect fractional matchings in \(k\)-out hypergraphs ⋮ Thresholds versus fractional expectation-thresholds ⋮ The constant objective value property for multidimensional assignment problems ⋮ On random multi-dimensional assignment problems
Cites Work
- Unnamed Item
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- Component structure in the evolution of random hypergraphs
- On the value of a random minimum spanning tree problem
- Asymptotics in the random assignment problem
- A proof of Parisi's conjecture on the random assignment problem
- Complexity of a 3-dimensional assignment problem
- The ?(2) limit in the random assignment problem
- On the expected value of the minimum assignment
- Factors in random graphs
- Assignment Problems
- On linear programs with random costs
- Constructive bounds and exact expectations for the random assignment problem
- Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
- Algorithm and Average-value Bounds for Assignment Problems
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
This page was built for publication: Efficient algorithms for three‐dimensional axial and planar random assignment problems
