Title of article
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract)
Author/Authors
Baltz، نويسنده , , Andreas and Schoen، نويسنده , , Tomasz and Srivastav، نويسنده , , Anand، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
42
To page
45
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.
Keywords
bipartite TSP
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453086
Link To Document