Approximation algorithms for the Geometric Covering Salesman Problem
type: Item
instance of: scholarly article
title: Approximation algorithms for the Geometric Covering Salesman Problem
zbMATH Open document ID: 0819.90115
DOI: 10.1016/0166-218X(94)90008-6
author: Esther M. Arkin
author: Refael Hassin
published in: Discrete Applied Mathematics
publication date: 1995-02-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 716321
zbMATH Keywords: covering salesman
zbMATH Keywords: tour of minimum length
MaRDI profile type: Publication
cites work: The swapping problem
cites work: Tight bounds for christofides' traveling salesman heuristic
cites work: The Covering Salesman Problem
cites work: Q4191856
cites work: An extension of Christofides heuristic to the k-person travelling salesman problem
cites work: Q4155835
cites work: Q3693290
cites work: Watchman routes under limited visibility
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
description: scientific article; zbMATH DE number 716321