Combinatorial optimization over two random point sets
Probability
2011-10-06 v2
Abstract
We analyze combinatorial optimization problems over a pair of random point sets 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.
Cite
@article{arxiv.1103.2734,
title = {Combinatorial optimization over two random point sets},
author = {Franck Barthe and Charles Bordenave},
journal= {arXiv preprint arXiv:1103.2734},
year = {2011}
}
Comments
34 pages