Combinatorial optimization over two random point sets

Details Combinatorial optimization over two random point sets Combinatorial optimization over two random point sets

2011-03-14

arxiv.org/abs/1103.2734v2

Mathematics

Probability

34 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Combinatorial optimization over two random point sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial optimization over two random point sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial optimization over two random point sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260519