Approximation algorithms for general cluster routing problem
type: Item
instance of: scholarly article
title: Approximation algorithms for general cluster routing problem
DOI: 10.1007/978-3-030-58150-3_38
author: Yanyan Li
publication date: 2021-04-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2006.12929
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336127
zbMATH Keywords: routing problem
zbMATH Keywords: approximation algorithm
zbMATH Keywords: general routing problem
MaRDI profile type: Publication
OpenAlex ID: W3162429168
cites work: Restricted delivery problems on a network
cites work: A note on the prize collecting traveling salesman problem
cites work: Traveling salesman path problems
cites work: The traveling salesman problem and its variations
cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles
cites work: An approximation algorithm for the general routing problem
cites work: Reducibility among Combinatorial Problems
cites work: P-Complete Approximation Problems
cites work: The Salesman’s Improved Paths through Forests
cites work: Eight-Fifth Approximation for the Path TSP
cites work: Approaching 3/2 for the s - t -path TSP
description: scientific article; zbMATH DE number 7336127