Complete convergence of the directed TSP

Complete convergence of the directed TSP

0.00 Avg rating—0 Votes
Article ID: iaor19921198
Country: United States
Volume: 16
Issue: 4
Start Page Number: 881
End Page Number: 887
Publication Date: Nov 1991
Journal: Mathematics of Operations Research
Authors:
Keywords: probability, graphs
Abstract:

Consider the random directed graph Gn whose vertices equ1are independent uniformly distributed over equ2. For equ3, the orientation of the edge equ4is selected at random, independently for each edge and independently of the equ5's. Denote by equ6the length of the shortest path through equ7. Then for some constant equ8and all equ9we have equ10.

Reviews

Required fields are marked *. Your email address will not be published.