Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract)

We consider two kinds of random settings of the bipartite TSP. For the asymmetric TSP we generalize a result of Frieze, Karp, and Reed concerning the relationship between the TSP and its assignment relaxation. Turning to the Euclidean bipartite TSP in the unit square we give an approximation algorithm for finding a short tour efficiently in parallel.