The Chinese deliveryman problem
type: Item
instance of: scholarly article
title: The Chinese deliveryman problem
zbMATH Open document ID: 1468.90116
author: Martijn van Ee
author: René A. Sitters
published in: 4OR
publication date: 2021-05-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7347308
zbMATH Keywords: Chinese deliveryman problem
zbMATH Keywords: approximation algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: Chinese postman problem
zbMATH Keywords: graph search
MaRDI profile type: Publication
full work available at URL: s10288-019-00420-2
OpenAlex ID: W2981260297
Wikidata QID: Q126992817
cites work: Approximation Schemes for Minimum Latency Problems
cites work: Probabilistic checking of proofs
cites work: Proof verification and the hardness of approximation problems
cites work: Q4250161
cites work: Generalizations in the linear search problem
cites work: Son of the linear search problem
cites work: The minimum latency problem
cites work: Matching, Euler tours and the Chinese postman
cites work: Asymmetric traveling salesman path and directed latency problems
cites work: Some simplified NP-complete graph problems
cites work: Euler, Mei-ko Kwan, Königsberg, and a Chinese postman
cites work: Star search -- a different show
cites work: Q4818841
cites work: The delivery man problem on a tree network
cites work: On the complexity of edge traversing
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: Q4737530
cites work: Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
DOI: 10.1007/S10288-019-00420-2
description: scientific article; zbMATH DE number 7347308