Combinatorial optimization over two random point sets

@inproceedings{Barthe2011CombinatorialOO,
title={Combinatorial optimization over two random point sets},
author={F. Barthe and Charles Bordenave},
year={2011}
}

We analyze combinatorial optimization problems over a random pair of points (X ,Y) in R of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set, or the connected bipartite r-regular graph of minimal length. As the cardinal of the sets goes to infinity, we investigate the convergence of such bipartite functionals.

volume 58 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI • 2003

View 2 Excerpts

Probability theory and combinatorial optimization

J. M. Steele

volume 69 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA • 1997

View 3 Excerpts

Asymptotics for transportation cost in high dimensions