Combinatorial optimization over two random point sets

  title={Combinatorial optimization over two random point sets},
  author={F. Barthe and Charles Bordenave},
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. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications referenced by this paper.
Showing 1-10 of 17 references

Probability theory of classical Euclidean optimization problems

J. Yukich
volume 1675 of Lecture Notes in Mathematics. Springer-Verlag, Berlin • 1998
View 14 Excerpts
Highly Influenced

On optimal matchings

View 10 Excerpts
Highly Influenced

Limit theorems and rates of convergence for Euclidean functionals

C. Redmond, J. Yukich
Ann. Appl. Probab., 4(4):1057–1073 • 1994
View 8 Excerpts
Highly Influenced

The shortest path through many points

J. Beardwood, J. H. Halton, J. M. Hammersley
Proc. Cambridge Philos. Soc., 55:299–327 • 1959
View 3 Excerpts
Highly Influenced

Topics in optimal transportation

C. Villani
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

V. Dobrić, J. E. Yukich
J. Theoret. Probab., 8(1):97–118 • 1995
View 3 Excerpts

Similar Papers

Loading similar papers…