Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems

DOI10.1007/978-3-319-62389-4_45zbMath1434.68684OpenAlexW2726117250MaRDI QIDQ2412434

Zhaohui Liu, Wei Yu

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_45

zbMATH Keywords

approximation algorithmtraveling salesman problempath covercycle coverapproximation hardnesstree cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems