Title
Solving the Traveling Salesman Problem Using Efficient Randomized Parallel Approximation Algorithms
Year
DOI
Venue
1997
10.1080/10637199708915622
Parallel Algorithms Appl.
Keywords
Field
DocType
probabilistic algorithm,traveling salesman,monte carlo,approximation algorithm,parallel algorithm,time complexity,randomized algorithm,traveling salesman problem
Integer,Bottleneck traveling salesman problem,Approximation algorithm,Randomized algorithm,Mathematical optimization,Parallel algorithm,Travelling salesman problem,Christofides algorithm,Time complexity,Mathematics
Journal
Volume
Issue
Citations 
10
3-4
0
PageRank 
References 
Authors
0.34
12
1
Name
Order
Citations
PageRank
Keqin Li15010.35