An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
type: Item
instance of: scholarly article
title: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
zbMATH Open document ID: 0795.68101
DOI: 10.1016/0020-0190(92)90103-3
author: Sundar Vishwanathan
published in: Information Processing Letters
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 167765
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: approximation algorithm
zbMATH Keywords: asymmetric travelling salesman problem
MaRDI profile type: Publication
full work available at URL: 0020-0190(92)90103-3
OpenAlex ID: W2021625223
cites work: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
cites work: Q4198056
cites work: Q4142699
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
cites work: Optimal covering of cacti by vertex-disjoint paths
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: Q4739657
cites work: On mapping processes to processors in distributed systems
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
description: scientific article; zbMATH DE number 167765