An approximation algorithm for a bottleneck traveling salesman problem
type: Item
instance of: scholarly article
title: An approximation algorithm for a bottleneck traveling salesman problem
zbMATH Open document ID: 1190.68082
author: Ming-Yang Kao
author: Manan Sanghi
published in: Journal of Discrete Algorithms
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5569527
zbMATH Keywords: bottleneck traveling salesman problem
zbMATH Keywords: job sequencing
zbMATH Keywords: two-machine flowshop
zbMATH Keywords: reconstruction from inaccurate adjacency
zbMATH Keywords: nuclear magnetic resonance spectroscopy
MaRDI profile type: Publication
full work available at URL: j.jda.2008.11.007
OpenAlex ID: W2057741299
cites work: 8/7-approximation algorithm for (1,2)-TSP
cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
cites work: Q3579379
cites work: Approximation algorithms for NMR spectral peak assignment.
cites work: Four point conditions and exponential neighborhoods for symmetric TSP
cites work: Q4198056
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: The traveling salesman problem and its variations
cites work: On the Flow-Shop Sequencing Problem with No Wait in Process†
cites work: On Gilmore-Gomory's open question for the bottleneck TSP.
cites work: Simple algorithms for gilmore-gomory's traveling salesman and related problems
cites work: Model-Based Assignment and Inference of Protein Backbone Nuclear Magnetic Resonances
DOI: 10.1016/J.JDA.2008.11.007
description: scientific article; zbMATH DE number 5569527