A (3/2+)-approximation for multiple TSP with a variable number of depots

DOI10.4230/LIPICS.ESA.2023.39MaRDI QIDQ6656986zbMATH OpenFDO

Authors Max A. Deppert, Matthias Kaul, Matthias Mnich

Publication date 6 January 2025

zbMATH Keywords

vehicle routingtraveling salesperson problemmultiple TSPrural postperson problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A \((3/2+\varepsilon)\)-approximation for multiple TSP with a variable number of depots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656986)