\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
type: Item
instance of: scholarly article
title: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
zbMATH Open document ID: 0879.68077
DOI: 10.1016/S0166-218X(97)89161-5
author: Igor Averbakh
author: Oded Berman
published in: Discrete Applied Mathematics
publication date: 1997-08-11T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1047186
zbMATH Keywords: traveling salesman
zbMATH Keywords: location-allocation problems
MaRDI profile type: Publication
cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
cites work: Q4198056
cites work: Two exact algorithms for the distance-constrained vehicle routing problem
OpenAlex ID: W2008992746
description: scientific article; zbMATH DE number 1047186