On the complexity of approximating TSP with neighborhoods and related problems
type: Item
instance of: scholarly article
title: On the complexity of approximating TSP with neighborhoods and related problems
zbMATH Open document ID: 1137.90753
author: Oded Schwartz
author: Shmuel Safra
published in: Computational Complexity
publication date: 2006-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5073642
zbMATH Keywords: NP-optimization problems
zbMATH Keywords: approximation
zbMATH Keywords: hardness of approximation
zbMATH Keywords: inapproximability
zbMATH Keywords: TSP
zbMATH Keywords: TSP with neighborhoods
MaRDI profile type: Publication
full work available at URL: s00037-005-0200-3
OpenAlex ID: W2141791003
DOI: 10.1007/S00037-005-0200-3
description: scientific article; zbMATH DE number 5073642