Random matching problems on the complete graph

DOI10.1214/ECP.v13-1372zbMath1189.60027MaRDI QIDQ1038879

Johan Wästlund

Publication date: 20 November 2009

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/233189

zbMATH Keywords

networkexpectationexponentialmean fieldminimum matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial probability (60C05)

Related Items (6)

Minimum Cost Matching in a Random Graph with Random Costs ⋮ Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs ⋮ The random fractional matching problem ⋮ Successive shortest paths in complete graphs with random edge weights ⋮ Strong and weighted matchings in inhomogenous random graphs ⋮ The Effect of Adding Randomly Weighted Edges

This page was built for publication: Random matching problems on the complete graph