SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS

DOI10.1080/10637199708915622zbMath0873.68091OpenAlexW2048039662MaRDI QIDQ3130161

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding Euler tours in parallel
• Matching is as easy as matrix inversion
• A Las Vegas RNC algorithm for maximum matching
• Parallel algorithms for the connected components and minimal spanning tree problems
• A Dynamic Programming Approach to Sequencing Problems
• An Efficient Parallel Biconnectivity Algorithm
• Efficient parallel algorithms for some graph problems
• P-Complete Approximation Problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• On the Complexity of Local Search for the Traveling Salesman Problem
• Tight bounds for christofides' traveling salesman heuristic
• Hamilton Paths in Grid Graphs
• An Algorithm for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

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