SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS

DOI10.1080/10637199708915622MaRDI QIDQ3130161zbMATH OpenOpenAlexFDO

Authors Keqin Li

Publication date 9 October 1997

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199708915622

zbMATH Keywords

traveling salesmanMonte Carlo CREW PRAM algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• The parallel complexity of TSP heuristics
• The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP
• New parallel randomized algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 808804
• scientific article; zbMATH DE number 4093206

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A Las Vegas RNC algorithm for maximum matching
• An Algorithm for the Traveling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Efficient Parallel Biconnectivity Algorithm
• Efficient parallel algorithms for some graph problems
• Finding Euler tours in parallel
• Hamilton Paths in Grid Graphs
• Matching is as easy as matrix inversion
• On the Complexity of Local Search for the Traveling Salesman Problem
• P-Complete Approximation Problems
• Parallel algorithms for the connected components and minimal spanning tree problems
• Tight bounds for christofides' traveling salesman heuristic

Cited in

(4)

• scientific article; zbMATH DE number 4093206 (Why is no real title available?)
• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
• scientific article; zbMATH DE number 4095242 (Why is no real title available?)
• New parallel randomized algorithms for the traveling salesman problem

This page was built for publication: SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130161)