Approximation algorithms for some minimum postmen cover problems

DOI10.1007/978-3-030-36412-0_30zbMath1443.90299OpenAlexW2993321047MaRDI QIDQ5970851

Yuying Mao, Zhaohui Liu, Wei Yu, Jiafeng Xiong

Publication date: 13 May 2020

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-36412-0_30

zbMATH Keywords

traveling salesman problemrural postman problemapproximation algorithmsChinese postman problempostmen cover

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ Approximation algorithms for some minimum postmen cover problems

This page was built for publication: Approximation algorithms for some minimum postmen cover problems