Approximation hardness of deadline-TSP reoptimization
type: Item
instance of: scholarly article
title: Approximation hardness of deadline-TSP reoptimization
zbMATH Open document ID: 1166.68042
author: Hans-Joachim Böckenhauer
author: Joachim Kneis
author: Joachim Kupke
published in: Theoretical Computer Science
publication date: 2009-05-28T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5559005
zbMATH Keywords: approximation algorithms
zbMATH Keywords: TSP with deadlines
zbMATH Keywords: reoptimization
zbMATH Keywords: inapproximability
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.02.016
OpenAlex ID: W2170739645
cites work: Reoptimizing the traveling salesman problem
cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
cites work: On the Approximation Hardness of Some Generalizations of TSP
cites work: The parameterized approximability of TSP with deadlines
cites work: Reoptimization of the Metric Deadline TSP
cites work: Q4532229
cites work: Q4377042
cites work: On the complexity of postoptimality analysis of \(0/1\) programs
cites work: Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
cites work: Stability aspects of the traveling salesman problem based on \(k\)-best solutions
cites work: Some concepts of stability analysis in combinatorial optimization
DOI: 10.1016/J.TCS.2009.02.016
description: scientific article; zbMATH DE number 5559005