Parameterized complexity of vehicle routing

DOI10.4230/LIPICS.IPEC.2025.10MaRDI QIDQ7356332zbMATH OpenFDO

Authors Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma

Publication date 23 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2025.10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• An ETH-Tight Exact Algorithm for Euclidean TSP
• Bin packing with fixed number of bins revisited
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
• Graph minors. III. Planar tree-width
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the capacitated vehicle routing problem
• Packing short cycles
• Parameterized algorithms
• The truck dispatching problem
• Walking through waypoints
• Waypoint routing on bounded treewidth graphs

This page was built for publication: Parameterized complexity of vehicle routing

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