Parameterized approximation algorithms for TSP

DOI10.4230/LIPICS.ISAAC.2022.50MaRDI QIDQ6602476zbMATH OpenFDO

Authors Jianqi Zhou, Peihua Li, Jiong Guo

Publication date 11 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2022.50

zbMATH Keywords

fixed-parameter tractabilityFPT-approximation algorithmsmetric graphsthe traveling salesman problemthe triangle inequality

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• From metric to general graphs: FPT constant-factor approximation algorithms for three location problems
• An FPT factor-11 approximation algorithm for TSP
• An FPT constant-factor approximation algorithm for correlation clustering

This page was built for publication: Parameterized approximation algorithms for TSP

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