@article{dmtcs:3504,
    title      = {Random assignment and shortest path problems},
    author     = {Johan Wästlund},
    url        = {https://dmtcs.episciences.org/3504},
    doi        = {10.46298/dmtcs.3504},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities},
    issuetitle = {Proceedings},
    eid        = 1,
    year       = {2006},
    month      = {Jan},
    keywords   = {minimum matching, random tree, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]},
    language   = {English},
}